中文
相关论文

相关论文: On some Generalized Fermat Equations of the form $…

200 篇论文

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

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

数论 · 数学 2025-10-07 Nuno Freitas , Michael Stoll

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

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

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…

数论 · 数学 2010-02-02 Sander R. Dahmen

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

数论 · 数学 2016-08-03 Samir Siksek , Michael Stoll

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…

数论 · 数学 2025-04-15 Ashleigh Ratcliffe , Bogdan Grechuk

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

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

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…

数论 · 数学 2008-06-11 Nicolas Billerey , Luis Dieulefait

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

We consider the Diophantine equation $7x^{2} + y^{2n} = 4z^{3}$. We determine all solutions to this equation for $n = 2, 3, 4$ and $5$. We formulate a Kraus type criterion for showing that the Diophantine equation $7x^{2} + y^{2p} = 4z^{3}$…

数论 · 数学 2021-06-30 Karolina Chałupka , Andrzej Dąbrowski , Gökhan Soydan

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…

数论 · 数学 2026-05-21 Satyabrat Sahoo

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…

综合数学 · 数学 2020-03-23 Yu-Lin Chou

Let $K$ be a totally real number field and $\mathcal{O}_K$ be the ring of integers of $K$. In this article, we study the asymptotic solutions of the generalized Fermat equation $Ax^p+By^p+Cz^p=0$ over $K$ with prime exponent $p$, where…

数论 · 数学 2026-02-11 Satyabrat Sahoo

We show that the Fermat equation $x^p + y^p = z^p$ has no solutions in coprime positive integers $x, y, z$ for any odd prime $p$.

综合数学 · 数学 2023-04-04 Zenon B. Batang

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…

数论 · 数学 2025-01-15 Imin Chen , Angelos Koutsianas
‹ 上一页 1 2 3 10 下一页 ›