English
Related papers

Related papers: The generalized Fermat equation with exponents 2, …

200 papers

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

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

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…

Number Theory · Mathematics 2025-04-17 Nicolas Billerey , Imin Chen , Luis Dieulefait , Nuno Freitas

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…

Number Theory · Mathematics 2025-07-04 Martin Azon

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

Let $p$ be an odd prime number. Let $K$ be the $p$-th cyclotomic field and $F$ its maximal real subfield. We give general formulae of the root numbers of the Jacobian varieties of the Fermat curves $X^p+Y^p=\delta$ where $\delta$ is an…

Number Theory · Mathematics 2021-11-30 Jie Shu

In this paper we prove new cases of the asymptotic Fermat equation with coefficients. This is done by solving remarkable $S$-units equations and applying a method of Frey-Mazur.

Number Theory · Mathematics 2020-11-10 Luis Dieulefait , Eduardo Soto

Let $K$ be a totally real number field of odd degree. Let $l \geq 5$ be a prime with $l \nmid [K:\mathbb{Q}]$ and $\gcd(\frac{l-1}{2}, [K:\mathbb{Q}])=1$. We prove that if $2$ is inert in $K$, $l$ is non-Wieferich, i.e., $2^{l-1} \not\equiv…

Number Theory · Mathematics 2026-05-21 Satyabrat Sahoo

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…

Number Theory · Mathematics 2022-03-10 Nicolas Billerey , Iimin Chen , Lassina Dembele , Luis Dieulefait , Nuno Freitas

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

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…

Number Theory · Mathematics 2025-12-05 Satyabrat Sahoo

This paper applies the modular approach to obtain effectively computable bounds for Fermat-type equations over number fields, while also discussing the differences and obstructions that arise when considering such equations over totally…

Number Theory · Mathematics 2026-02-25 Begum Gulsah Cakti

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

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…

Number Theory · Mathematics 2010-02-02 Sander R. Dahmen

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…

Number Theory · Mathematics 2025-10-16 Nicolas Billerey , Imin Chen , Lassina Dembélé , Luis Dieulefait , Nuno Freitas

A generalized Mordell curve of degree $n \ge 3$ over $\bQ$ is the smooth projective model of the affine curve of the form $Az^2 = Bx^n + C$, where $A, B, C$ are nonzero integers. A generalized Fermat curve of signature $(n, n, n)$ with $n…

Number Theory · Mathematics 2012-12-17 Dong Quan Ngoc Nguyen

Let $K$ be a totally real field, and $r\geq 5$ a fixed rational prime. In this paper, we use the modular method as presented in the recent work of Freitas and Siksek to study non-trivial, primitive solutions $(x,y,z) \in \mathcal{O}_K^3$ of…

Number Theory · Mathematics 2022-12-22 Diana Mocanu

Let $K$ be a totally real number field and consider a Fermat-type equation $Aa^p+Bb^q=Cc^r$ over $K$. We call the triple of exponents $(p,q,r)$ the signature of the equation. We prove various results concerning the solutions to the Fermat…

Number Theory · Mathematics 2022-07-11 Diana Mocanu

Within the scope of elementary number theory, we prove that, as the main result, if $1 \leq x < y < z$ are integers such that at least one of $y, z, x+y$ is prime then $x^{n}+y^{n} \neq z^{n}$ for every odd integer $n \geq 3$. This result…

General Mathematics · Mathematics 2020-03-23 Yu-Lin Chou

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