Related papers: Solving Fermat-type equations $x^4 + d y^2 = z^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 problem of finding all possible extensions of a given rational diophantine quadruple to a rational diophantine quintuple is equivalent to the determination of the set of rational points on a certain curve of genus 5 that can be written…

In this paper we will exhibit a rational parametric solution for the Diophantine equations of diagonal quartic varieties. Our approach is based on utilizing the Calabi-Yau varieties including elliptic curves and diagonal quartic surfaces.

In this paper, we analyze the theta series associated to the quadratic form $Q(\mathbf{x}) := x_1^2 + x_2^2 + x_3^2 + x_4^2$ with congruence conditions on $x_i$ modulo $2, 3, 4$, and $6$. By employing special operators on modular,…

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…

Let $C$ be a curve defined over a number field $K$. A point $P\in C(\overline{\mathbb{Q}})$ is called $K$-quadratic if $[K(P):K]=2$. Let $K$ be a number field such that the rank of the elliptic curves $E_1:\,y^2= x^3 + 4x$ and $E_2:\,y^2=…

Assume a polynomial-time algorithm for factoring integers, Conjecture~\ref{conj}, $d\geq 3,$ and $q$ and $p$ are prime numbers, where $p\leq q^A$ for some $A>0$. We develop a polynomial-time algorithm in $\log(q)$ that lifts every…

Recent results of Freitas, Kraus, Sengun and Siksek, give sufficient criteria for the asymptotic Fermat's Last Theorem to hold over a specific number field. Those works in turn build on many deep theorems in arithmetic geometry. In this…

Let $p\geq 3$ be a prime number. A Fermat curve over $\mathbb{Q}$ of exponent $p$ is defined by an equation of the shape $ax^p+by^p+cz^p=0$, where $a,b,c$ are non-zero rational numbers. We prove in this article that there exist infinitely…

Let $p$ be an odd prime number. Using modular arguments, we give an easy testable condition which allows often to prove Fermat's Last Theorem over the quadratic field ${\bf Q}(\sqrt{5})$ for the exponent $p$. It is related to the Wendt's…

Let $\ell$ and $p$ be (not necessarily distinct) prime numbers and $F$ be a global function field of characteristic $\ell$ with field of constants $\kappa$. Assume that there exists a prime $P_\infty$ of $F$ which has degree $1$, and let…

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

In this paper, we consider the Diophantine equation $(-1)^{\alpha}p^x+(-1)^{\beta}(2^k(2p+1))^y=z^2$ for Sophie Germain prime $p$ with $\alpha, \beta \in\{0,1\}$, $\alpha\beta=0$ and $k\geq 0$. First, for $p=2$, we solve three Diophantine…

In this paper, we study the integer solutions of a family of Fermat-type equations of signature $(2, 2n, n)$, $Cx^2 + q^ky^{2n} = z^n$. We provide an algorithmically testable set of conditions which, if satisfied, imply the existence of a…

We study the solutions of a Diophantine equation of the form $a^x+b^y=c^z$, where $a\equiv 2 \pmod 4$, $b\equiv 3 \pmod 4$ and $\gcd (a,b,c)=1$. The main result is that if there exists a solution $(x,y,z)=(2,2,r)$ with $r>1$ odd then this…

We discuss the equation $a^p + 2^\a b^p + c^p =0$ in which $a$, $b$, and $c$ are non-zero relatively prime integers, $p$ is an odd prime number, and $\a$ is a positive integer. The technique used to prove Fermat's Last Theorem shows that…

Everybody knows from school how to solve a quadratic equation of the form $x^2-px+q=0$ graphically. But this method can become tedious if several equations ought to be solved, as for each pair $(p,q)$ a new parabola has to be drawn.…

Take complex numbers $a_j,b_j$, $(j=0,1,2)$ such that $c\neq0$ and {\rm rank} ( {ccc} a_{0} & a_{1} & a_{2} b_{0} & b_{1} & b_{2} )=2. We show that if the following functional equation of Fermat type…

In this paper we present a new method of solving the classical diophantine equation $A^4+B^4=C^4+D^4$. Two methods of solving this equation, given by Euler, yield parametric solutions given by polynomials of degrees 7 and 13. Several other…

In this paper, we obtain new results on the integers solutions X, Y, Z of the diophantine equation X^t+Y^t=BZ^t for a rationnal integer B and a prime number t verifying some conditions explained in the paper.