Related papers: Polynomial representation of Fermat's Last Theorem

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…

Some properties and relations satisfied by the polynomial solutions of a bispectral problem are studied. Given a finite order differential operator, under certain restrictions, its polynomial eigenfunctions are explicitly obtained, as well…

We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…

In this paper, we consider sums of generalized polygonal numbers with repeats, generalizing Fermat's polygonal number theorem which was proven by Cauchy. In particular, we obtain the minimal number of generalized $m$-gonal numbers required…

In this paper we present an elementary proof for a special case of Fermat's last theorem for specific category of a, b and c. In fact, we assume that $n$ is prime and $4\rvert (n+1),$ then for $a,b$ and $c$ that $ n\nmid abc$ the equation…

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 new sufficient condition which allows to test primality of Fermat's numbers. This characterization uses uniquely values at most equal to tested Fermat number. The robustness of this result is due to a strict use of elementary…

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…

Fermat's Last Theorem (FLT) implies that the Frey curves do not exist. A proof of FLT independent of proved Taniyama-Shimura-Weil conjecture is presented.

The classical quadratic formula and some of its lesser known variants for solving the quadratic equation are reviewed. Then, a new formula for the roots of a quadratic polynomial is presented.

This article, complement to the article [Que], deals with some generalizations of Futw\"angler's theorems for the second case of Fermat's Last Theorem (FLT2). Let $p$ be an odd prime, $\zeta$ a $p$th primitive root of unity, $K:=\Q(\zeta)$…

We present the only proof of Pierre Fermat by descente infinie that is known to exist today. As the text of its Latin original requires active mathematical interpretation, it is more a proof sketch than a proper mathematical proof. We…

In this note we prove that the factorization theorem for dominated polynomials previously proved by the authors is equivalent to an alternative factorization scheme that uses classical linear techniques and a linearization process. However,…

Inspired by the work about solutions of a system of real polynomial equations done by Hermite, this paper introduces a Hermitian form, which encodes information about solutions of a system of complex polynomial equations with conjugate…

Let $F$ be a number field and $\mathcal{O}_F$ its ring of integers. We use Chevalley's ambiguous class number formula to give a criterion for the non-existence of solutions to the unit equation $\lambda + \mu = 1$, $\lambda, \mu \in…

This paper is devoted to finding solutions of polynomial equations in roots of unity. It was conjectured by S. Lang and proved by M. Laurent that all such solutions can be described in terms of a finite number of parametric families called…

Fermat Last Theorem, which inspired mathematicians during 300 years, is proved by Andrew Wiles. Even among mathematicians there is a narrow circle of specialists, who can read this proof and understand all details. Is it a reason for…

In this short article we do not prove Fermat's last theorem. We show that the number 2 is an exceptional number in this theorem.

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

We prove a constant term theorem which is useful for finding weight polynomials for Ballot/Motzkin paths in a strip with a fixed number of arbitrary `decorated' weights as well as an arbitrary `background' weight. Our CT theorem, like…