Abstract
On the urgent request of several coenthusiasts around the globe in the field of Factorization of Mersenne Numbers, the author publishes here for the first time the search limits on divisorsq of 2p − 1, even when no divisor up to this limit was found. This list, therefore, should avoid time consuming double work.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
V. A. Golubev,Nombres de Mersenne et caractères du nombre 2, Mathesis 67 (1958), 257–262.
E. Karst,Faktorenzerlegung Mersennescher Zahlen mittels programmgesteuerter Rechengeräte, Numerische Mathematik 3 (1961), 79–86.
E. Karst,New Factors of Mersenne Numbers, Mathematics of Computation 15 (1961), 51.
E. Karst,Some New Divisors of Mersenne Numbers, BIT 2 (1962), 90.
S. Kravitz,Divisors of Mersenne Numbers 10,000<p<15,000, Mathematics of Computation 15 (1961), 292–293.
H. Riesel,Mersenne Numbers, MTAC 12 (1958), 207–213.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Karst, E. Search Limits on Divisors of Mersenne numbers. BIT 2, 224–227 (1962). https://doi.org/10.1007/BF01940169
Issue Date:
DOI: https://doi.org/10.1007/BF01940169