相关论文: A result on the equation $x^p + y^p = z^r$ using F…

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

Recent results of Freitas, Kraus, Sengun and Siksek give sufficient criteria for the asymptotic Fermat's Last Theorem to hold over various number fields. In this paper, we prove asymptotic results about the solutions of the Diophantine…

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…

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…

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…

Let $K$ be a number field. Using the modular method, we prove asymptotic results on solutions of the Diophantine equation $x^4-y^2=z^p$ over $K$, assuming some deep but standard conjectures of the Langlands programme when $K$ has at least…

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 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 paper, we prove results about solutions of the Diophantine equation $x^p+y^p=z^3$ over various number fields using the modular method. Firstly, by assuming some standard modularity conjecture we prove an asymptotic result for…

In the beautiful article [11] Darmon proposed a program to study integral solutions of the generalized Fermat equation $Ax^p+By^q=Cz^r$. In the aforementioned article, Darmon proved many steps of the program, by exhibiting models of…

We follow the ideas of Darmon's program for solving infinite families of generalised Fermat equations of signatures $(p,p,r)$ and $(r,r,p)$, where, $r$ is a fixed prime and $p$ is varying. We do so by introducing a common framework for both…

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

Following the famous proof of Fermat's Last Theorem by Andrew Wiles using the modularity of elliptic curves over $\mathbb{Q}$, significant developments have been made in the study of Diophantine equations using the modularity method. This…

Let $p$ be a prime integer, $\mathbb{Z}_p$ the finite field of order $p$ and $\mathbb{Z}^{*}_{p}$ is its multiplicative cyclic group. We consider the Diophantine equation $x^n + y^n = z^n$ with $1 \leq n \leq \frac{p - 1}{2}$. Our main aim…

Let K be a totally real Galois number field and let A be a set of elliptic curves over K. We give sufficient conditions for the existence of a finite computable set of rational primes P such that for p not in P and E in A, the…