Related papers: Asymptotic Generalized Fermat's Last Theorem over …

Let $\mathcal{F}(h)$ be the number of imaginary quadratic fields with class number $h$. In this note, we improve the error term in Soundararajan's asymptotic formula for the average of $\mathcal{F}(h)$. Our argument leads to a similar…

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…

In this paper, we give a resolution of the generalized Fermat equations $$x^5 + y^5 = 3 z^n \text{ and } x^{13} + y^{13} = 3 z^n,$$ for all integers $n \ge 2$, and all integers $n \ge 2$ which are not a multiple of $7$, respectively, using…

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…

This article deals with a conjecture generalizing the second case of Fermat's Last Theorem, called $SFLT2$ conjecture: {\it Let $p>3$ be a prime, $K:=\Q(\zeta)$ the $p$th cyclotomic field and $\Z_K$ its ring of integers. The diophantine…

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…

In this article, we present streamlined proofs of results of Ankeny, Artin, and Chowla concerning the fundamental unit of the real quadratic field $\mathbb{Q}(\sqrt{p})$ for primes $p\equiv 1 \bmod{4}$ while providing a generalization of…

Let $K$ be a totally real field, and $r\geq 5$ a fixed rational prime. In this paper, we use the modular method as presented in the recent work of Freitas and Siksek to study non-trivial, primitive solutions $(x,y,z) \in \mathcal{O}_K^3$ of…

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.

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…

We introduce the theory $\mathrm{PF}^{+,\times}$ of pseudofinite fields with generic additive and multiplicative character added as continuous logic predicates. Using the Weil bounds on character sums over finite fields as well as the…

In this paper two conjectures are proposed based on which we can prove the first case of Fermat's Last Theorem(FLT) for all primes $p \equiv -1 (\bmod~6)$. With Pollaczek's result {\bf [1]} and the conjectures the first case of FLT can be…

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…

In this article we prove lower and upper bounds for class numbers of algebraic curves defined over finite fields. These bounds turn out to be better than most of the previously known bounds obtained using combinatorics. The methods used in…

Let $K$ be a fixed number field, and assume that $K$ is Galois over $\qq$. Previously, the author showed that when estimating the number of prime ideals with norm congruent to $a$ modulo $q$ via the Chebotar\"ev Density Theorem, the mean…

Using the modular method, we study solutions to the Diophantine equation $$Aa^p+Bb^p=Cc^2$$ over number fields. We first prove an asymptotic result for general number fields satisfying an appropriate $S$-unit condition by assuming some…

Using a combination of several powerful modularity theorems and class field theory we derive a new modularity theorem for semistable elliptic curves over certain real abelian fields. We deduce that if $K$ is a real abelian field of…

Let $p$ be a prime number. In the early 2000s, it was proved that the Fermat equations with coefficients \[3x^p + 8y^p + 21z^p =0\quad \text{ and } \quad 3x^p + 4y^p + 5z^p=0 \] do not admit non-trivial solutions for a set of exponents $p$…

For every $n \geq 2$ we determine the asymptotic formula for the number of integer triples $(a,b,c)$ of bounded absolute value such that the generalised Fermat equation given by $ax^n+by^n+cz^n=0$ is everywhere locally soluble. We compute…

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…