Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

   
Remote Access
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)

 

A new criterion for the first case of Fermat's last theorem


Authors: Karl Dilcher and Ladislav Skula
Journal: Math. Comp. 64 (1995), 363-392
MSC: Primary 11D41; Secondary 11Y50
MathSciNet review: 1248969
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

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 [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 11D41, 11Y50

Retrieve articles in all journals with MSC: 11D41, 11Y50


Additional Information

DOI: http://dx.doi.org/10.1090/S0025-5718-1995-1248969-6
PII: S 0025-5718(1995)1248969-6
Article copyright: © Copyright 1995 American Mathematical Society