Related papers: Elementary proof of Fermat's Last Theorem for even…

Let $p \ge 5$ be a prime and let $\mathbb{Q}_{n,p}$ denote the $n$-th layer of the cyclotomic $\mathbb{Z}_p$-extension of $\mathbb{Q}$. We show that $\mathbb{Q}_{n,p}$ has no exceptional units. We use this to prove the effective asymptotic…

The recently developed proof of Fermat's Last Theorem is very lengthy and difficult, so much so as to be beyond all but a small body of specialists. While certainly of value in the developments that resulted, that proof could not be, nor…

Let $K$ be a number field and $p$ a prime number $\geq 5$. Let us denote by $\mu_p$ the group of the $p$th roots of unity. We define $p$ to be $K$-regular if $p$ does not divide the class number of the field $K(\mu_p)$. Under the assumption…

We will be presenting two theorems in this paper. The first theorem, which is a new result, is about the non-existence of integer solutions of the cubic diophantine equation. In the proof of this theorem we have used some known results from…

We show that Fermat's last theorem and a combinatorial theorem of Schur on monochromatic solutions of $a+b=c$ implies that there exist infinitely many primes. In particular, for small exponents such as $n=3$ or $4$ this gives a new proof of…

We propose a new approach at Fermat's Last Theorem (FLT) solution: for each FLT equation we associate a polynomial of the same degree. The study of the roots of the polynomial allows us to investigate the FLT validity. This technique,…

Let $K$ be a totally real field. By the asymptotic Fermat's Last Theorem over $K$ we mean the statement that there is a constant $B_K$ such that for prime exponents $p>B_K$ the only solutions to the Fermat equation $a^p + b^p + c^p = 0$…

We give a cyclotomic proof of the fact that the equation $\frac{x^p + y^p}{x+y} = p^e z^p$ has no solutions in coprime integers $x,y,z$ and $p > 3$, a prime. This implies in particular Fermat's Last Theorem.

`Fermat's Last Theorem for the exponent 3 has received numerous proofs, the most common of which being either in Euler's or in Gauss' style. This latter works entirely in the ring of integers of the quadratic field generated by the square…

Within the scope of elementary number theory, we prove that, as the main result, if $1 \leq x < y < z$ are integers such that at least one of $y, z, x+y$ is prime then $x^{n}+y^{n} \neq z^{n}$ for every odd integer $n \geq 3$. This result…

We study Fermat's Last Theorem and Catalan's conjecture in the context of weak arithmetics with exponentiation. We deal with expansions (B,e) of models of arithmetical theories (in the language L=(0,1,+,x,<)) by a binary (partial or total)…

Let $K$ be a totally real number field. For all prime number $p\geq 5$, let us denote by $F_p$ the Fermat curve of equation $x^p+y^p+z^p=0$. Under the assumption that $2$ is totally ramified in $K$, we establish some results about the set…

We take the perspective of an advanced high school student trying to understand the proof of Fermat's Last Theorem for the first time. We collect definitions and statements needed to summarise how Fermat's Last Theorem was first proved in…

In our work we give the examples using Fermat's Last Theorem for solving some problems from algebra and number theory.

Let $K$ be a totally real number field of odd degree. Let $l \geq 5$ be a prime with $l \nmid [K:\mathbb{Q}]$ and $\gcd(\frac{l-1}{2}, [K:\mathbb{Q}])=1$. We prove that if $2$ is inert in $K$, $l$ is non-Wieferich, i.e., $2^{l-1} \not\equiv…

This work contains two papers: the first published in 2022 and entitled "On the nature of some Euler's double equations equivalent to Fermat's last theorem" provides a marvellous proof through the so-called discordant forms of appropriate…

Two centuries ago, Sophie Germain began to work on her grand plan to prove the theorem of Fermat, the famous conjecture that $x^n + y^n = z^n$ is impossible for nonzero integral values of $x$, $y$, and $z$, when $n > 2$. At that time, this…

The divisibility restrictions in the famous equation a n+bn=cn in Fermat Last Theorem (FLT, 1637) is analyzed how it selects out many triples to be Fermat triple (i.e. solutions) if n greater than 2, decreasing the cardinality of Fermat…

Fermat's Last Theorem is proved by using the philosophical and mathematical knowledge of 1637 when the French mathematician Pierre de Fermat claimed to have a truly marvelous proof of his conjecture. Our approach consists of setting three…

The Modular Group provides simple proofs of Fermat's representations: X^2+Y^2 for primes congruent to 1 (mod 4) and by X^2+3Y^2 for primes congruent to 1 (mod 3)