Related papers: On the equation $a^p + 2^alpha b^p + c^p =0$

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 the Fermat equation $x^p + y^p = z^p$ has no solutions in coprime positive integers $x, y, z$ for any odd prime $p$.

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…

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.

In this paper, we consider some hybrid Diophantine equations of addition and multiplication. We first improve a result on new Hilbert-Waring problem. Then we consider the equation \begin{equation} \begin{cases} A+B=C ABC=D^n \end{cases}…

We give a cyclotomic proof of the fact that the equation $\frac{x^p + y^p}{x+y} = p^e z^q$ has no solutions in coprime integers $x,y,z$ and $p > 3; q$, a pair of distinct odd primes.

In a recent paper, Freitas and Siksek proved an asypmtotic version of Fermat's Last Theorem for many totally real fields. We prove an extension of their result to generalized Fermat equations of the form $A x^p+B y^p+ C z^p=0$, where $A$,…

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 the present article, we extend previous results of the author and we show that when $K$ is any quadratic imaginary field of class number one, Fermat's equation $a^p+b^p+c^p=0$ does not have integral coprime solutions $a,b,c \in K…

In this work, we prove the following result(Theorem 1): Suppose that n is a positive integer, p an odd prime, and such that either n is congruent to 0 modulo4 and p congruent to 3 modulo8; or alternatively, n is congruent to 2 modulo4 and p…

We prove that the Fermat-type equation $x^3 + y^3 = z^p$ has no solutions $(a,b,c)$ satisfying $abc \ne 0$ and $\gcd(a,b,c)=1$ when $-3$ is not a square mod~$p$. This improves to approximately $0.844$ the Dirichlet density of the set of…

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…

Kurepa's conjecture states that there is no odd prime $p$ that divides $!p=0!+1!+\cdots+(p-1)!$. We search for a counterexample to this conjecture for all $p<2^{34}$. We introduce new optimization techniques and perform the computation…

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

Fix a rational prime $r \geq 5$. In this article, we study the integer solutions of the generalized Fermat equation of signature $(2p,2q,r)$, namely $x^{2p}+y^{2q}=z^r$, where the primes $p,q \geq 5$ are varying. For each rational prime $r…

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

This article deals with a conjecture, introduced in [GQ] (hereinafter $SFLT2$), which generalizes the second case of Fermat's Last Theorem: {\it Let $p>3$ be a prime. The diophantine equation $\frac{u^p+v^p}{u+v}=w_1^p$ with $u,v,u+v,…

The title equation, where $p>3$ is a prime number $\not\equiv 7 \pmod 8$, $q$ is an odd prime number and $x,y,n$ are positive integers with $x,y$ relatively prime, is studied. When $p\equiv 3\pmod 8$, we prove (Theorem 2.3) that there are…

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…

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…