# The first case of Fermat's last theorem

```@article{Adleman1985TheFC,
title={The first case of Fermat's last theorem},
author={Leonard M. Adleman and D. R. Heath-Brown},
journal={Inventiones mathematicae},
year={1985},
volume={79},
pages={409-416}
}```
• Published 1985
• Mathematics
• Inventiones mathematicae
Fermat’s Last Theorem (FLT) states that x + y = z has no integer solution for n > 2. It is easy to show that if the theorem is true when n equals some integer r, then it is true when n equals any multiple of r. Since every integer greater than 2 is divisible by 4 or an odd prime, it is sufficient to prove the theorem for n = 4 and every odd prime. On 19 September 1994, Andrew Wiles announced that he had finally completed the proof of FLT. Today we will see an elementary proof by Sophie Germain… Expand
New bound for the first case of Fermat’s last theorem
• Mathematics
• 1989
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 generalizedExpand
Class Field Theory and the First Case of Fermat’s Last Theorem
• Mathematics
• 1997
For a prime number p, the first case of Fermat’s last theorem for exponent p asserts that for any three integers x, y, z with xp+yp+zp=O at least one of x, y, z is divisible by p. In the presentExpand
Introduction to Fermat's Last Theorem
The announcement last summer of a proof of Fermat's Last Theorem was an exciting event for the entire mathematics community. This article will discuss the mathematical history of Fermat's LastExpand
On Wendt's Determinant and Sophie Germain's Theorem
• Mathematics, Computer Science
• Exp. Math.
• 1993
The investigation of a conjecture about essential prime factors of R n leads to a proof that CaseI of Fermat's Last Theorem holds for any prime exponent p > 2 such that np + 1 is prime for some integer n ≤ 500 not divisible by 3. Expand
The first case of fermat’s last theorem is true for all prime exponents up to 714, 591, 416, 091, 389
• Mathematics
• 1988
We show that if the first case of Fermat’s Last Theorem is false for prime exponent p then p2 divides qp — q for all primes q < Sq. As a corollary we state the theorem of the title. © 1988 AmericanExpand
The first case of fermat’s last theorem
Fermat , a r o u n d 1637, s t a ted tha t the D i o p h a n t i n e equation x n + yn = z ~ has no solutions in positive integers, if n > 2. This s tatement, which has never been p roved or dExpand
Finding integers k for which a given Diophantine equation has no solution in kth powers of integers
(1) f(x1 , x k 2 , . . . , x k n) = 0 has solutions in non-zero integers x1, x2, . . . , xn. For homogeneous diagonal f of degree one, Davenport and Lewis [DL] showed that k ∈ T (f) whenever (n − 1)Expand
On the method of Coleman and Chabauty
Let C be a curve of genus g >_ 2, defined over a number field K , and let J be the Jacobian of C. Coleman [C2], following Chabauty, has shown how to obtain good bounds on the cardinality of C(K) ifExpand
Arithmetic applications of Kloosterman sums
• Mathematics
• 2000
Last April saw the 100-th anniversary of the birth of H.D. Kloosterman. The occasion was celebrated by a one day meeting in Leiden, and this article is a report on one of the lectures given. ItExpand
Fermat’s Last Theorem
The last chapter brings a short survey on the work on Fermat’s Last Theorem, culminating in its proof.