Related papers: Polynomial representation of Fermat's Last Theorem

The solution of equations from the title is well known since the Euler's time. However, its proof in the case of multiple roots of the characteristic polynomial is rather long and technical and even appearance of the factors $x^m$ looks…

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…

Assuming a deep but standard conjecture in the Langlands programme, we prove Fermat's Last Theorem over $\mathbb Q(i)$. Under the same assumption, we also prove that, for all prime exponents $p \geq 5$, Fermat's equation $a^p+b^p+c^p=0$…

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…

Wiles' proof of Fermat's last theorem initiated a powerful new approach towards the resolution of certain Diophantine equations over $\mathbb{Q}$. Numerous novel obstacles arise when extending this approach to the resolution of Diophantine…

We construct a computable, computably categorical field of infinite transcendence degree over the rational numbers, using the Fermat polynomials and assorted results from algebraic geometry. We also show that this field has an intrinsically…

This paper presents an alternative proof of the Fundamental Theorem of Algebra that has several distinct advantages. The proof is based on simple ideas involving continuity and differentiation. Visual software demonstrations can be used to…

This paper is submitted to Algebraic-Number-Theory Archives for validation by Number Theorists Community. It is an update of the previous versions ANT-0155, ANT-0170, ANT-0205, ANT-0237, ANT-0321, ANT-0333, and ANT-0356, of which the first…

Recent work of Freitas and Siksek showed that an asymptotic version of Fermat's Last Theorem holds for many totally real fields. Later this result was extended by Deconinck to generalized Fermat equations of the form $Ax^p +By^p +Cz^p = 0$,…

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 use Newton's method to find all roots of several polynomials in one complex variable of degree up to and exceeding one million and show that the method, applied to appropriately chosen starting points, can be turned into an algorithm…

We formalize a complete proof of the regular case of Fermat's Last Theorem in the Lean4 theorem prover. Our formalization includes a proof of Kummer's lemma, that is the main obstruction to Fermat's Last Theorem for regular primes. Rather…

We show that Wilson's theorem as well as the Wilson quotient can be described by supercongruences modulo any higher prime power involving terms of power sums of Fermat quotients. The new approach uses Bell polynomials and Newton's…

We prove Fermat's Last Theorem over ${\mathbb Q}(\sqrt{5})$ and ${\mathbb Q}(\sqrt{17})$ for prime exponents $p \ge 5$ in certain congruence classes modulo $48$ by using a combination of the modular method and Brauer-Manin obstructions…

Fermat's Last theorem (FLT) famously states that the equation $x^n+y^n=z^n$ has no solution in positive integers $x, y, z$ for any integer exponent $n>2$. But does this theorem have a quantitative version? Upon initial investigation we…

This paper develops a framework of algebra whereby every Diophantine equation is made quickly accessible by a study of the corresponding row entries in an array of numbers which we call the Newtonian triangles. We then apply this framework…

In this essay, we see how prime cyclotomic fields (cyclotomic fields obtained by adjoining a primitive p-th root of unity to Q, where p is an odd prime) can lead to elegant proofs of number theoretical concepts. We namely develop the notion…

We give a sufficient and necessary condition for a p-adic integer to have p-th root in the ring of p-adic integers. The same condition holds clearly for residues modulo p^k. We give a proof that Fermat's last theorem is false for p-adic…

We formalise the well-known rules of partial differentiation in a version of equational logic with function variables and binding constructs. We prove the resulting theory is complete with respect to polynomial interpretations. The proof…

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…