Primitive prime factors in second order linear recurrence sequences

2012/12/27 by Granville, Andrew
#FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1212.6306

Abstract

For a class of Lucas sequences x_n, we show that if n is a positive integer then x_n has a primitive prime factor which divides x_n to an odd power, except perhaps when n = 1, 2, 3 or 6. This has several desirable consequences.

Related

• Primitive Divisors of Lucas Sequences in Polynomial Rings
• On the divisibility of the rank of appearance of a Lucas sequence
• The terms in Lucas sequences divisible by their indices
• On prime factors of terms of binary recurrence sequences
• Prime Factors of Dynamical Sequences