中文
相关论文

相关论文: Fermat-type equations of signature (13,13,p) via H…

200 篇论文

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…

数论 · 数学 2013-11-01 Nuno Freitas

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…

数论 · 数学 2022-12-22 Diana Mocanu

We prove that the Fermat-type equation $x^3 + y^3 = z^p$ has no solutions $(a,b,c)$ satisfying $abc \ne 0$ and $\gcd(a,b,c)=1$ when $-3$ is not a square mod~$p$. This improves to approximately $0.844$ the Dirichlet density of the set of…

数论 · 数学 2016-01-26 Nuno Freitas

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…

数论 · 数学 2026-03-02 Ariel Pacetti , Lucas Villagra Torcomian

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…

数论 · 数学 2024-07-09 Nicolas Billerey , Imin Chen , Luis Dieulefait , Nuno Freitas

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

数论 · 数学 2007-05-23 Luis Dieulefait

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…

数论 · 数学 2023-06-13 Nuno Freitas , Filip Najman

We give a cyclotomic proof of the fact that the equation $\frac{x^p + y^p}{x+y} = p^e z^q$ has no solutions in coprime integers $x,y,z$ and $p > 3; q$, a pair of distinct odd primes.

数论 · 数学 2025-09-24 Preda Mihailescu

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…

数论 · 数学 2025-10-15 Alex J. Best , Sander R. Dahmen , Nuno Freitas

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…

数论 · 数学 2011-03-29 Luis Dieulefait , Nuno Freitas

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…

综合数学 · 数学 2017-08-11 Yochay Jerby

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…

数论 · 数学 2022-03-10 Erman Isik , Yasemin Kara , Ekin Ozman

Using a combination of several powerful modularity theorems and class field theory we derive a new modularity theorem for semistable elliptic curves over certain real abelian fields. We deduce that if $K$ is a real abelian field of…

数论 · 数学 2016-09-07 Samuele Anni , Samir Siksek

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…

数论 · 数学 2008-04-14 Luis Dieulefait , Jorge Jimenez Urroz

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…

数论 · 数学 2025-09-26 Satyabrat Sahoo

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…

数论 · 数学 2019-06-17 Nuno Freitas , Bartosz Naskrecki , Michael Stoll

We give a cyclotomic proof of the fact that the equation $\frac{x^p + y^p}{x+y} = p^e z^p$ has no solutions in coprime integers $x,y,z$ and $p > 3$, a prime. This implies in particular Fermat's Last Theorem.

数论 · 数学 2025-09-24 Boris Bartolomé , Preda Mihailescu

We show that the generalized Fermat equations with signatures (5,5,7), (5,5,19), and (7,7,5) (and unit coefficients) have no non-trivial primitive integer solutions. Assuming GRH, we also prove the nonexistence of non-trivial primitive…

数论 · 数学 2014-01-28 Sander R. Dahmen , Samir Siksek

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…

数论 · 数学 2016-01-20 Nuno Freitas , Samir Siksek
‹ 上一页 1 2 3 10 下一页 ›