Another Note on the Greatest Prime Factors of Fermat Numbers

  title={Another Note on the Greatest Prime Factors of Fermat Numbers},
  author={Aleksander Grytczuk and Marek W{\'o}jtowicz and Florian Luca},
  journal={Southeast Asian Bulletin of Mathematics},
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. 
A New and Simple Prime Sieving Technique for Generating Primes Ending with a Given Odd Digit
  • Okoh Ufuoma
  • Mathematics
    Asian Research Journal of Mathematics
  • 2019
The essence of this paper is to furnish a simple prime sieving technique which deletes composites from a nite list of natural numbers ending with any given odd digit with the exception of the digit
About Diophantine Equations, an Analytic Approach
  • Mathematics
  • 2010
Our purpose in this paper is to show how much diophantine equations are rich in analytic applications. Effectively, those equations allow to build amazing sequences, series and numbers. The question
Od Fermatových prvočísel ke geometrii
V tomto clanku M. Křižek zkouma výskyt Fermatových cisel v geometrii. Nejprve ve zkratce vysvětluje, co to Fermatova cisla jsou a jaka jsou dnes znama. V dalsi kapitole ukazuje využiti Fermatových


On the large sieve
The purpose of this paper is to give a new and improved version of Linnik's large sieve, with some applications. The large sieve has its roots in the Hardy-Littlewood method, and in its most general