相关论文: The Generalized Fermat Equation $x^2 + y^3 = z^{25…

We determine the set of primitive integral solutions to the generalised Fermat equation x^2 + y^3 = z^15. As expected, the only solutions are the trivial ones with xyz = 0 and the non-trivial pair (x,y,z) = (+-3, -2, 1).

The primary aim of this paper is to study the generalized Fermat equation \[ x^2+y^{2n} = z^{3p} \] in coprime integers $x$, $y$, and $z$, where $n \geq 2$ and $p$ is a fixed prime. Using modularity results over totally real fields and the…

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…

Let $n \in \mathbb{Z}_{\geq 2}$. We study the generalized Fermat equation \[x^{13}+y^{13}=z^n, \quad x,y,z \in \mathbb{Z}, \quad \gcd(x,y,z)=1.\] Using a combination of techniques, including the modular method, classical descent, unit…

In this paper, we develop the modular method for the generalized Fermat equation appearing in the title, within the framework of Darmon's program and using Frey hyperelliptic curves. As an application, we study a conjecture of Laradji,…

We give sufficient conditions to determine the existence of nontrivial solutions to the Fermat equation $x^3+y^3=kz^3$ over $\mathbb{Q}(\sqrt{d})$ by constructing a relationship with the points on the elliptic curve $y^2=x^3-432d^3k^2$ over…

Generalised Fermat equation (GFE) is the equation of the form $ax^p+by^q=cz^r$, where $a,b,c,p,q,r$ are positive integers. If $1/p+1/q+1/r<1$, GFE is known to have at most finitely many primitive integer solutions $(x,y,z)$. A large body of…

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…

We solve the Diophantine equations $x^5 + y^5 = dz^p$ with $d=2, 3$ for a set of prime numbers of density 1/4, 1/2, respectively. The method consists in relating a possible solution to another Diophantine equation and solving the later by…

In this article we study solutions to the generalized Fermat equation $x^q+y^p+z^r=0 $ using hypergeometric motives within the framework of the modular method. In doing so, we give an explicit description of the ramification behavior at…

We prove two results concerning the generalized Fermat equation $x^4+y^4=z^p$. In particular we prove that the First Case is true if $p \neq 7$.

We solve the Fermat-type equation \[ x^{13} + y^{13} = 3 z^7, \qquad \gcd(x,y,z) = 1 \] combining a unit sieve, the multi-Frey modular method, level raising, computations of systems of eigenvalues modulo 7 over a totally real field, and…

We classify primitive integer solutions to x^2 + y^3 = z^10. The technique is to combine modular methods at the prime 5, number field enumeration techniques in place of modular methods at the prime 2, Chabauty techniques for elliptic curves…

Let $n$ be a positive integer and consider the Diophantine equation of generalized Fermat type $x^2+y^{2n}=z^3$ in nonzero coprime integer unknowns $x,y,z$. Using methods of modular forms and Galois representations for approaching…

A solution $(x,y,z) \in \mathbb{Z}^3-\{(0,0,0)\}$ to a generalized Fermat equation \[ Ax^a + By^b + Cz^c = 0, \] is called \emph{primitive} if $\gcd(x,y,z) = 1$. By work of Beukers, we know that in the \emph{spherical} regime (that is, when…

In this paper we are interested in solving the Fermat-type equations x^5+y^5=dz^p where d is a positive integer and p a prime number $\ge 7$. We describe a new method based on modularity theorems which allows us to improve all the results…

We determine the rational integers x,y,z such that x^3+y^9=z^2 and gcd(x,y,z)=1. First we determine a finite set of curves of genus 10 such that any primitive solution to x^3+y^9=z^2 corresponds to a rational point on one of those curves.…

In this paper we carry out the steps of Darmon's program for the generalized Fermat equation $$ x^n + y^n = z^5. $$ In particular, we develop the machinery necessary to prove an optimal bound on the exponent $n$ for solutions satisfying…

[This is an older version of the paper, which will be updated soon.] In the present paper, we continue our research on the generalized Fermat equation $x^r + y^s = z^t$ with signature $(r, s, t)$, where $r, s, t \ge 2$ are positive integers…

We solve the diophantine equations x^4 + d y^2 = z^p for d=2 and d=3 and any prime p>349 and p>131 respectively. The method consists in generalizing the ideas applied by Frey, Ribet and Wiles in the solution of Fermat's Last Theorem, and by…