Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
The following link can be shared to navigate to this page. You can select the link to copy or click the 'Copy To Clipboard' button below.
Copy To Clipboard
Successfully Copied!
Density of Prime Divisors of Linear Recurrences
 
Front Cover for Density of Prime Divisors of Linear Recurrences
Available Formats:
Electronic 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
Front Cover for Density of Prime Divisors of Linear Recurrences
Click above image for expanded view
  • Front Cover for Density of Prime Divisors of Linear Recurrences
  • Back Cover for Density of Prime Divisors of Linear Recurrences
Density of Prime Divisors of Linear Recurrences
Available Formats:
Electronic 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 Details
     
     
    Memoirs of the American Mathematical Society
    Volume: 1151995; 102 pp
    MSC: 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.

    Readership

    Graduate 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$
  • Request Review Copy
  • Get Permissions
Volume: 1151995; 102 pp
MSC: 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.

Readership

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$
Please select which format for which you are requesting permissions.