Related papers: Fermat Theorems -- Simple Proofs

We prove two results concerning the generalized Fermat equation $x^4+y^4=z^p$. In particular we prove that the First Case is true if $p \neq 7$.

We study the Generalized Fermat Equation $x^2 + y^3 = z^p$, to be solved in coprime integers, where $p \ge 7$ is prime. Using modularity and level lowering techniques, the problem can be reduced to the determination of the sets of rational…

Using modularity, level lowering, and explicit computations with Hilbert modular forms, Galois representations and ray class groups, we show that for $3 \le d \le 23$ squarefree, $d \ne 5$, $17$, the Fermat equation $x^n+y^n=z^n$ has no…

Let $a \in \mathbb{Z}_{>0}$ and $\epsilon_1, \epsilon_2, \epsilon_3 \in \{\pm 1\}$. We classify explicitly all singular moduli $x_1, x_2, x_3$ satisfying either $\epsilon_1 x_1^a + \epsilon_2 x_2^a + \epsilon_3 x_3^a \in \mathbb{Q}$ or…

We provide several extensions of the modular method which were motivated by the problem of completing previous work to prove that, for any integer $n \geq 2$, the equation \[ x^{13} + y^{13} = 3 z^n \] has no non-trivial solutions. In…

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…

This note proves two theorems regarding Fermat-type equation $x^r + y^r = dz^p$ where $r \geq 5$ is a prime. Our main result shows that, for infinitely many integers~$d$, the previous equation has no non-trivial primitive solutions such…

In this article we study solutions to the generalized Fermat equation $x^q+y^p+z^r=0 $ using hypergeometric motives within the framework of the modular method. In doing so, we give an explicit description of the ramification behavior at…

Fermat's statement is equivalent to say that if $x$, $y$, $z$, $n$ are integers and $n>2$, then $z^{n}\gtrless x^{n}+y^{n}$. This is proved with the aid of numbers $\lambda $'s, of the form $\lambda =z/\rho $, with $1<\rho<z$, named…

We show that the existence of a non-trivial solution of $x^n+y^n=p^n$, with $p$ a prime number, is equivalent to the existence of a solution of a certain (over-determined) system of $(n-1)$-recursion relations ("zipper" equations) in…

We announce here that Fermat's Last theorem was solved, but there is an easy proof of it on the basis of elemetary undergraduate mathematics. We shall disclose such an easy proof.

It is shown that the quartic Fermat equation $x^4 +y^4=1$ has nontrivial integral solutions in the Hilbert class field $\Sigma$ of any quadratic field $K=\mathbb{Q}(\sqrt{-d})$ whose discriminant satisfies $-d \equiv 1$ (mod 8). A corollary…

We solve the diophantine equations x^4 + d y^2 = z^p for d=2 and d=3 and any prime p>349 and p>131 respectively. The method consists in generalizing the ideas applied by Frey, Ribet and Wiles in the solution of Fermat's Last Theorem, and by…

`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…

We present a modular function-based approach to explaining, for primes larger than 3, the exponents that appear in the prime decomposition of the order of the monster finite simple group.

Let $\alpha,\beta,\gamma\in\mathbb{N}$. We prove that given an $r$-colouring of $\mathbb{F}_p$ with $p$ prime, there are more than $c_{r,\alpha,\beta,\gamma} p^2$ solutions to the equation $x^\alpha+y^\beta=z^\gamma$ with all of $x,y,z$ of…

A elementary proof of Fermat"s Last Theorem[1] is presented for the case of even exponents n=2q, where q is any integer, including 2. For even exponents, the proof of the theorem reduces to showing that solutions of the Pythagorean equation…

Euler proves that the sum of two 4th powers can't be a 4th power and that the difference of two distinct non-zero 4th powers can't be a 4th power and Fermat's theorem that the equation x(x+1)/2=y^4 can only be solved in integers if x=1 and…

We present an elementary inductive proof which Euler could have obtained, for the corresponding result as the title indicates, had he refined a bit his proof for Fermat's assertion on representing primes as two squares.

Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum ab+cd of two ordered products ab and cd such that min(a, b) > max(c, d). An easy corollary is a proof of Fermat's Theorem expressing primes in 1 + 4N as sums of two…