Uniform explicit Stewart theorem on prime factors of linear recurrences
Tom 206 / 2022
Acta Arithmetica 206 (2022), 223-243
MSC: Primary 11B39; Secondary 11B37.
DOI: 10.4064/aa211116-13-11
Opublikowany online: 16 December 2022
Streszczenie
Stewart (2013) proved that the largest prime divisor of the $n$th 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.
