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.


New bound for the first case of Fermat’s last theorem
HTML articles powered by AMS MathViewer

by Jonathan W. Tanner and Samuel S. Wagstaff PDF
Math. Comp. 53 (1989), 743-750 Request permission


We present an improvement to Gunderson’s function, which gives a lower bound for the exponent in a possible counterexample to the first case of Fermat’s "Last Theorem," assuming that the generalized Wieferich criterion is valid for the first n prime bases. The new function increases beyond $n = 29$, unlike Gunderson’s, and it increases more swiftly. Using the recent extension of the Wieferich criterion to $n = 24$ by Granville and Monagan, the first case of Fermat’s "Last Theorem" is proved for all prime exponents below 156, 442, 236, 847, 241, 729.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 11D41, 11Y50
  • Retrieve articles in all journals with MSC: 11D41, 11Y50
Additional Information
  • © Copyright 1989 American Mathematical Society
  • Journal: Math. Comp. 53 (1989), 743-750
  • MSC: Primary 11D41; Secondary 11Y50
  • DOI:
  • MathSciNet review: 982371