English
Related papers

Related papers: Modular congruences, Q-curves, and the diophantine…

200 papers

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…

Number Theory · Mathematics 2008-04-14 Luis Dieulefait , Jorge Jimenez Urroz

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.

Number Theory · Mathematics 2007-05-23 Luis Dieulefait

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…

Number Theory · Mathematics 2011-03-29 Luis Dieulefait , Nuno Freitas

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…

Number Theory · Mathematics 2023-11-22 Erman Isik

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…

Number Theory · Mathematics 2022-04-14 Philippe Michaud-Jacobs

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…

Number Theory · Mathematics 2008-06-11 Nicolas Billerey , Luis Dieulefait

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…

Number Theory · Mathematics 2019-06-17 Nuno Freitas , Bartosz Naskrecki , Michael Stoll

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…

Number Theory · Mathematics 2023-06-13 Nuno Freitas , Filip Najman

We prove a diophantine result on generalized Fermat equations of the form $x^p + y^p = z^r$ which for the first time requires the use of Frey abelian varieties of dimension $\geq 2$ in Darmon's program. For that, we provide an…

Number Theory · Mathematics 2016-05-10 Nicolas Billerey , Imin Chen , Luis Dieulefait , Nuno Freitas

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…

Number Theory · Mathematics 2022-09-20 Lucas Villagra Torcomian

We give some new, simple results on the equation X^p + Y^p = Z^q.

Number Theory · Mathematics 2007-05-23 Preda Mihailescu

The Modular Group provides simple proofs of Fermat's representations: X^2+Y^2 for primes congruent to 1 (mod 4) and by X^2+3Y^2 for primes congruent to 1 (mod 3)

Number Theory · Mathematics 2021-09-22 Robert J Sibner

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

Number Theory · Mathematics 2026-05-05 Pedro-José Cazorla García , Angelos Koutsianas , Lucas Villagra-Torcomian

We show that the existence of a non-trivial solution of $x^n+y^n=p^n$, with $p$ a prime number, is equivalent to the existence of a solution of a certain (over-determined) system of $(n-1)$-recursion relations ("zipper" equations) in…

General Mathematics · Mathematics 2017-08-11 Yochay Jerby

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…

Number Theory · Mathematics 2025-04-15 Nicolas Billerey , Imin Chen , Luis Dielefait , Nuno Freitas

It is shown that the quartic Fermat equation $x^4 +y^4=1$ has nontrivial integral solutions in the Hilbert class field $\Sigma$ of any quadratic field $K=\mathbb{Q}(\sqrt{-d})$ whose discriminant satisfies $-d \equiv 1$ (mod 8). A corollary…

Number Theory · Mathematics 2015-10-07 Rodney Lynch , Patrick Morton

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…

Number Theory · Mathematics 2025-10-07 Nuno Freitas , Michael Stoll

We describe a strategy to attack infinitely many Fermat-type equations of signature $(r,r,p)$, where $r \geq 7$ is a fixed prime and $p$ is a prime allowed to vary. We use a variant of the modular method over totally real subfields of…

Number Theory · Mathematics 2013-11-01 Nuno Freitas

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…

Number Theory · Mathematics 2025-09-26 Satyabrat Sahoo

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…

Number Theory · Mathematics 2009-05-21 Konstantine Zelator
‹ Prev 1 2 3 10 Next ›