Uniform explicit Stewart's theorem on prime factors of linear recurrences
Number Theory
2022-10-04 v5
Abstract
Stewart (2013) proved that the biggest prime divisor of the th term of a Lucas sequence of integers grows quicker than , 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.
Cite
@article{arxiv.2108.09857,
title = {Uniform explicit Stewart's theorem on prime factors of linear recurrences},
author = {Yuri Bilu and Haojie Hong and Sanoli Gun},
journal= {arXiv preprint arXiv:2108.09857},
year = {2022}
}