Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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 (2001)
Wagstaff S.S. Jr.: Divisors of Mersenne numbers. Math. Comput. 40, 385–397 (1983)
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported in part by Conicet.
Rights and permissions
About this article
Cite this article
Panzone, P.A. On the generating functions of Mersenne and Fermat primes. Collect. Math. 63, 59–69 (2012). https://doi.org/10.1007/s13348-010-0019-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13348-010-0019-3