Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

   
Mobile Device Pairing
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)

 

New primes of the form $ k\cdot 2\sp{n}+1$


Author: Robert Baillie
Journal: Math. Comp. 33 (1979), 1333-1336
MSC: Primary 10A25
Erratum: Math. Comp. 38 (1982), 335.
MathSciNet review: 537979
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: All primes of the form $ k \cdot {2^n} + 1$ for k odd, $ 1 \leqslant k < 150$, $ 1 \leqslant n \leqslant 1500$, have now been computed. Those not previously published are given here. Numbers with $ 151 \leqslant k \leqslant 999$ and $ n \leqslant 600$ were also tested. Three new factors of Fermat numbers and a large pair of twin primes were found.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 10A25

Retrieve articles in all journals with MSC: 10A25


Additional Information

DOI: http://dx.doi.org/10.1090/S0025-5718-1979-0537979-0
PII: S 0025-5718(1979)0537979-0
Keywords: Fermat numbers, factoring, twin primes
Article copyright: © Copyright 1979 American Mathematical Society