Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society, the Mathematics of Computation (MCOM) is devoted to research articles of the highest quality in all areas of pure and applied mathematics.

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

The 2020 MCQ for Mathematics of Computation is 1.98.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.


A search for large twin prime pairs
HTML articles powered by AMS MathViewer

by R. E. Crandall and M. A. Penk PDF
Math. Comp. 33 (1979), 383-388 Request permission


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.
    V. BRUN, "La série $1/5 + 1/7 + 1/11 + 1/13 + \cdots$ est convergente ou finie," Bull. Sci. Math., v. 43, 1919, pp. 104, 124-128; Chapter XVI.
  • G. H. Hardy and J. E. Littlewood, Some problems of ‘Partitio numerorum’; III: On the expression of a number as a sum of primes, Acta Math. 44 (1923), no. 1, 1–70. MR 1555183, DOI 10.1007/BF02403921
  • D. H. LEHMER, "Tables concerning the distribution of primes up to 37 millions," MTAC, v. 13, 1959, pp. 56-57, UMT 3. G. H. HARDY & E. M. WRIGHT’, An Introduction to the Theory of Numbers, 4th ed., Clarendon Press, Oxford, 1965.
  • Richard P. Brent, Irregularities in the distribution of primes and twin primes, Math. Comp. 29 (1975), 43–56. MR 369287, DOI 10.1090/S0025-5718-1975-0369287-1
  • D. H. Lehmer, Computer technology applied to the theory of numbers, Studies in Number Theory, Math. Assoc. America, Buffalo, N.Y.; distributed by Prentice-Hall, Englewood Cliffs, N.J., 1969, pp. 117–151. MR 0246815
  • Donald E. Knuth, The art of computer programming. Vol. 2, 2nd ed., Addison-Wesley Series in Computer Science and Information Processing, Addison-Wesley Publishing Co., Reading, Mass., 1981. Seminumerical algorithms. MR 633878
  • Richard K. Guy, How to factor a number, Proceedings of the Fifth Manitoba Conference on Numerical Mathematics (Univ. Manitoba, Winnipeg, Man., 1975) Congressus Numerantium, No. XVI, Utilitas Math. Publ., Winnipeg, Man., 1976, pp. 49–89. MR 0404120
  • J. M. Pollard, A Monte Carlo method for factorization, Nordisk Tidskr. Informationsbehandling (BIT) 15 (1975), no. 3, 331–334. MR 392798, DOI 10.1007/bf01933667
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 10A25, 10J10
  • Retrieve articles in all journals with MSC: 10A25, 10J10
Additional Information
  • © Copyright 1979 American Mathematical Society
  • Journal: Math. Comp. 33 (1979), 383-388
  • MSC: Primary 10A25; Secondary 10J10
  • DOI:
  • MathSciNet review: 514834