论文信息 - Uniform explicit Stewart's theorem on prime factors of linear recurrences

Uniform explicit Stewart's theorem on prime factors of linear recurrences

Stewart (2013) proved that the biggest prime divisor of the nth term of a Lucas sequence of integers grows quicker than n, answering famous questions of Erdős and Schinzel. In this note we obtain a fully explicit and, in a sense, uniform version of Stewart’s result.

Yuri Bilu | Haojie Hong | Sanoli Gun

[1] Kunrui Yu. p-adic logarithmic forms and a problem of Erdős , 2013 .

[2] Andrzej Schinzel,et al. On the product of the conjugates outside the unit circle of an algebraic number , 1973 .

[3] Paul Voutier,et al. An effective lower bound for the height of algebraic numbers , 2012, 1211.3110.

[4] A. Schinzel. Addendum to the paper "On the product of the conjugates outside the unit circle of an algebraic number" , 1975 .

[5] A. Meyer,et al. Introduction to Number Theory , 2005 .

[6] J. Rosser,et al. Approximate formulas for some functions of prime numbers , 1962 .

[7] H. Iwaniec,et al. Sieve Methods , 2000 .

[8] G. Robin. Estimation de la fonction de Tchebychef θ sur le k-ième nombre premier et grandes valeurs de la fonction ω(n) nombre de diviseurs premiers de n , 1983 .

[9] Binary polynomial power sums vanishing at roots of unity , 2020, 2005.05500.

[10] A. Schinzel. Primitive divisors of the expression An - Bn in algebraic number fields. , 1968 .

[11] Habiba Kadiri,et al. Primes in the Chebotarev density theorem for all number fields , 2021 .

[12] C.L.Stewart. On divisors of Lucas and Lehmer numbers , 2010, 1008.1274.

[13] Gerald Höhn,et al. Un résultat de Schinzel , 1993 .

[14] G. Martin,et al. Explicit bounds for primes in arithmetic progressions , 2018, 1802.00085.

[15] Edward Dobrowolski,et al. On a question of Lehmer and the number of irreducible factors of a polynomial , 1979 .