相关论文: On the generalized Fermat equation $x^{13} + y^{13…

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 provide several extensions of the modular method which were motivated by the problem of completing previous work to prove that, for any integer $n \geq 2$, the equation \[ x^{13} + y^{13} = 3 z^n \] has no non-trivial solutions. In…

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).

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 consider the generalized Fermat equation (*) $x^2 + y^3 = z^{25}$. Using the known parameterization of the primitive integral solutions to $x^2 + y^3 = z^5$ (due to Edwards), we reduce the solution of (*) to the solution of five specific…

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

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

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…

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…

We obtain additional Diophantine applications of the methods surrounding Darmon's program for the generalized Fermat equation developed in the first part of this series of papers. As a first application, we use a multi-Frey approach…

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…

In this paper we prove that equations of the form $x^{13} + y^{13} = Cz^{p}$ have no non-trivial primitive solutions (a,b,c) such that $13 \nmid c$ if $p > 4992539$ for an infinite family of values for $C$. Our method consists in relating a…

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

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…

In 2000, Darmon described a program to study the generalized Fermat equation using modularity of abelian varieties of $\mathrm{GL}_2$-type over totally real fields. The original approach was based on hard open conjectures, which have made…

We give a method to solve generalized Fermat equations of type $x^4 + y^4 = q z^p$, for some prime values of $q$ and every prime $p$ bigger than 13. We illustrate the method by proving that there are no solutions for $q= 73, 89$ and 113.

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

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…