Density of Prime Divisors of Linear Recurrences
Nicht lieferbar
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 gene...
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.