Another Note on the Greatest Prime Factors of Fermat Numbers
- 12 Downloads
For every positive integer k > 1, let P(k) be the largest prime divisor of k. In this note, we show that if Fm = 22m + 1 is the m‘th Fermat number, then P(Fm) ≥ 2m+2(4m + 9) + 1 for all m ≥ 4. We also give a lower bound of a similar type for P(Fa,m), where Fa,m = a2m + 1 whenever a is even and m ≥ a18.
Keywords.Fermat number greatest prime factor linear forms in p-adic logarithms
Unable to display preview. Download preview PDF.