| eBook ISBN: | 978-1-4704-0130-6 |
| Product Code: | MEMO/115/551.E |
| List Price: | $42.00 |
| MAA Member Price: | $37.80 |
| AMS Member Price: | $25.20 |
| eBook ISBN: | 978-1-4704-0130-6 |
| Product Code: | MEMO/115/551.E |
| List Price: | $42.00 |
| MAA Member Price: | $37.80 |
| AMS Member Price: | $25.20 |
-
Book DetailsMemoirs of the American Mathematical SocietyVolume: 115; 1995; 102 ppMSC: Primary 11
A result due to Hasse says that, on average, 17 out of 24 consecutive primes will divide a number in the sequence \(U_n = 2^n+1\). There are few sequences of integers for which this relative density can be computed exactly. In this work, Ballot links Hasse's method to the concept of the group associated with the set of second-order recurring sequences having the same characteristic polynomial and to the concept of the rank of prime division in a Lucas sequence. This combination of methods and ideas allows the establishment of new density results. Ballot also shows that this synthesis can be generalized to recurring sequences of any order, for which he also obtains new density results. All the results can be shown to be in close agreement with the densities computed using only a small set of primes. This well-written book is fairly elementary in nature and requires only some background in Galois theory and algebraic number theory.
ReadershipGraduate students, mathematicians, and possibly computer scientists with an interest in number theory.
-
Table of Contents
-
Chapters
-
Introduction
-
1. General preliminaries
-
2. Background material
-
3. More about recurring sequences of order two
-
4. A study of the cubic case
-
5. Study of the general case $m \geq 2$
-
-
RequestsReview Copy – for publishers of book reviewsPermission – for use of book, eBook, or Journal contentAccessibility – to request an alternate format of an AMS title
- Book Details
- Table of Contents
- Requests
A result due to Hasse says that, on average, 17 out of 24 consecutive primes will divide a number in the sequence \(U_n = 2^n+1\). There are few sequences of integers for which this relative density can be computed exactly. In this work, Ballot links Hasse's method to the concept of the group associated with the set of second-order recurring sequences having the same characteristic polynomial and to the concept of the rank of prime division in a Lucas sequence. This combination of methods and ideas allows the establishment of new density results. Ballot also shows that this synthesis can be generalized to recurring sequences of any order, for which he also obtains new density results. All the results can be shown to be in close agreement with the densities computed using only a small set of primes. This well-written book is fairly elementary in nature and requires only some background in Galois theory and algebraic number theory.
Graduate students, mathematicians, and possibly computer scientists with an interest in number theory.
-
Chapters
-
Introduction
-
1. General preliminaries
-
2. Background material
-
3. More about recurring sequences of order two
-
4. A study of the cubic case
-
5. Study of the general case $m \geq 2$
