Uniform explicit Stewart's theorem on prime factors of linear recurrences
ACTA ARITHMETICA(2022)
摘要
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\H{o}s and Schinzel. In this note we obtain a fully explicit and, in a sense, uniform version of Stewart's result.
更多查看译文
关键词
prime factors,Lucas sequence,p-adic logarithmic form
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要