Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

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

The 2020 MCQ for Mathematics of Computation is 1.78.

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.


Determination of the primality of $N$ by using factors of $N^{2}\pm 1$
HTML articles powered by AMS MathViewer

by H. C. Williams and J. S. Judd PDF
Math. Comp. 30 (1976), 157-172 Request permission


Algorithms are developed which can be used to determine the primality of a large integer N when a sufficient number of prime factors of ${N^2} + 1$ are known. A test for the primality of N which makes use of known factors of $N - 1,N + 1$ and ${N^2} + 1$ and the factor bounds on these numbers is also presented. In order to develop the necessary theory, the properties of some functions which are a generalization of Lehmer functions are used. Several examples of numbers proved prime by employing these tests are given.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 10A25
  • Retrieve articles in all journals with MSC: 10A25
Additional Information
  • © Copyright 1976 American Mathematical Society
  • Journal: Math. Comp. 30 (1976), 157-172
  • MSC: Primary 10A25
  • DOI:
  • MathSciNet review: 0396390