Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



A search for large twin prime pairs

Authors: R. E. Crandall and M. A. Penk
Journal: Math. Comp. 33 (1979), 383-388
MSC: Primary 10A25; Secondary 10J10
MathSciNet review: 514834
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Two methods are discussed for finding large integers m such that $m - 1$ and $m + 1$ are both primes. Eight such numbers m of magnitudes 22, 22, 32, 64, 136, 154, 203, and 303 digits are listed; together with primitive roots (for $m + 1$) and Lucas-Lehmer parameters (for $m - 1$). The Hardy-Littlewood twin prime conjecture is supported by a statistical test involving the generation of 249 twin prime pairs in the 50-to-54 digit region.

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

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 10A25, 10J10

Retrieve articles in all journals with MSC: 10A25, 10J10

Additional Information

Keywords: prime, twin primes, Hardy-Littlewood conjecture
Article copyright: © Copyright 1979 American Mathematical Society