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

Abstract

Stewart (2013) proved that the biggest 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.

References in corpus (2)

• Théorème de Chebotarev effectif
• Primes in the Chebotarev density theorem for all number fields