On the generating functions of Mersenne and Fermat primes

• Autores: Pablo A. Panzone
• Localización: Collectanea mathematica, ISSN 0010-0757, Vol. 63, Fasc. 1, 2012, págs. 59-69
• Idioma: inglés
• DOI: 10.1007/s13348-010-0019-3
• Texto completo no disponible (Saber más ...)
• Resumen

  • With the aid of Solomon Golomb formula we give closed formulas for the generating functions of Mersenne and Fermat primes. A limit-type criteria for the existence of an infinite number of such primes is given using these generating functions.

• Referencias bibliográficas
  • Borwein, J.M., Borwein, P.B.: Pi and the AGM, Canadian Mathematical Society. Series of Monographs and Advanced Texts, vol. 4, New York (1987)
  • Crandall R., Pomerance C.: Prime Numbers, A Computational Perspective. Springer, New York (2001)
  • Gillies D.B.: Three new Mersenne primes and a statistical theory. Math. Comput. 18, 93–97 (1964)
  • Golomb S.W.: The lambda method in prime number theory. J. Number Theory 2, 193–198 (1970)
  • Ligh S., Neal L.: A note on Mersenne numbers. Math. Mag. 47, 231–233 (1974)
  • Schroeder M.R.: Where is the next Mersenne prime hiding?. Math. Intelligencer 5, 31–33 (1983)
  • Titchmarsh E.C.: The theory of the Riemann zeta-function. The Clarendon Press, Oxford University Press, New York (1986)
  • Wagstaff S.S. Jr.: Prime numbers with a fixed number of one bits or zero bits in their binary representation. Experiment. Math. 10, 267–273...
  • Wagstaff S.S. Jr.: Divisors of Mersenne numbers. Math. Comput. 40, 385–397 (1983)