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.

 

Fermat’s last theorem (case $1$) and the Wieferich criterion
HTML articles powered by AMS MathViewer

by Don Coppersmith PDF
Math. Comp. 54 (1990), 895-902 Request permission

Abstract:

This note continues work by the Lehmers [3], Gunderson [2], Granville and Monagan [1], and Tanner and Wagstaff [6], producing lower bounds for the prime exponent p in any counterexample to the first case of Fermat’s Last Theorem. We improve the estimate of the number of residues $r\bmod {p^2}$ such that ${r^p} \equiv r\bmod {p^2}$, and thereby improve the lower bound on p to $7.568 \times {10^{17}}$.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 11D41
  • Retrieve articles in all journals with MSC: 11D41
Additional Information
  • © Copyright 1990 American Mathematical Society
  • Journal: Math. Comp. 54 (1990), 895-902
  • MSC: Primary 11D41
  • DOI: https://doi.org/10.1090/S0025-5718-1990-1010598-2
  • MathSciNet review: 1010598