Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

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



Three summation criteria for Fermat's last theorem

Author: H. Schwindt
Journal: Math. Comp. 40 (1983), 715-716
MSC: Primary 10-04; Secondary 10B15
MathSciNet review: 689484
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: This paper extends the search for solutions of the congruences

$\displaystyle \sum\limits_1^{[p/6]} {\frac{1}{i} \equiv 0,} \quad \sum\limits_1... ...ext{and}}\quad \sum\limits_{[p/6] + 1}^{[p/5]} {\frac{1}{i} \equiv 0\;\pmod p} $

to the limit $ p < 600000$. The only solutions found were $ p = 61$ in the first case, in the second $ p = 205129$, and in the third case $ p = 109$ and $ p = 491$.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 10-04, 10B15

Retrieve articles in all journals with MSC: 10-04, 10B15

Additional Information

Article copyright: © Copyright 1983 American Mathematical Society