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.

 

A new criterion for the first case of Fermat’s last theorem
HTML articles powered by AMS MathViewer

by Karl Dilcher and Ladislav Skula PDF
Math. Comp. 64 (1995), 363-392 Request permission

Abstract:

It is shown that if the first case of Fermat’s last theorem fails for an odd prime l, then the sums of reciprocals modulo l, $s(k,N) = \sum 1/j\;(kl/N < j < (k + 1)l/N)$ are congruent to zero $\bmod \;l$ for all integers N and k with $1 \leq N \leq 46$ and $0 \leq k \leq N - 1$. This is equivalent to ${B_{l - 1}}(k/N) - {B_{l - 1}} \equiv 0 \pmod l$, where ${B_n}$ and ${B_n}(x)$ are the nth Bernoulli number and polynomial, respectively. The work can be considered as a result on Kummer’s system of congruences.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 11D41, 11Y50
  • Retrieve articles in all journals with MSC: 11D41, 11Y50
Additional Information
  • © Copyright 1995 American Mathematical Society
  • Journal: Math. Comp. 64 (1995), 363-392
  • MSC: Primary 11D41; Secondary 11Y50
  • DOI: https://doi.org/10.1090/S0025-5718-1995-1248969-6
  • MathSciNet review: 1248969