中文
相关论文

相关论文: The Fermat-type equations x^5 + y^5 = 2z^p or 3z^p…

200 篇论文

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

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

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

The solvability of Diophantine quartic equations is a contemporary area of interest due to its connection with generalized Fermat's equation. In this work, we are interested in the integer solutions of a similar Diophantine equation p u^2 =…

数论 · 数学 2026-05-26 Vinodkumar Ghale

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

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

Let $p$ be a prime number. In the early 2000s, it was proved that the Fermat equations with coefficients \[3x^p + 8y^p + 21z^p =0\quad \text{ and } \quad 3x^p + 4y^p + 5z^p=0 \] do not admit non-trivial solutions for a set of exponents $p$…

数论 · 数学 2016-06-15 Nuno Freitas , Alain Kraus

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

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

We solve Diophantine equations of the type $ a \, (x^3 \!+ \! y^3 \!+ \! z^3 ) = (x \! + \! y \! + \! z)^3$, where $x,y,z$ are integer variables, and the coefficient $a\neq 0$ is rational. We show that there are infinite families of such…

数论 · 数学 2025-03-14 Bogdan A. Dobrescu , Patrick J. Fox

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…

数论 · 数学 2016-05-10 Nicolas Billerey , Imin Chen , Luis Dieulefait , Nuno Freitas

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

In this paper we obtain a parametric solution of the hitherto unsolved diophantine equation $(x_1^5+x_2^5)(x_3^5+x_4^5)=(y_1^5+y_2^5)(y_3^5+y_4^5)$. Further, we show, using elliptic curves, that there exist infinitely many parametric…

数论 · 数学 2021-04-20 Ajai Choudhry , Oliver Couto

In this paper, we refine the method introduced by Izadi and Baghalaghdam to search integer solutions to the Diophantine equation $X_1^5+X_2^5+X_3^5=Y_1^3+Y_2^3+Y_3^3$. We show that the Diophantine equation has infinitely many positive…

数论 · 数学 2019-06-25 Gaku Iokibe

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

数论 · 数学 2007-05-23 Preda Mihailescu

In this paper, elliptic curves theory is used for solving the Diophantine equations X^3+Y^3+Z^3+aU^k=a_0U_0^{t_0}+...+a_nU_n^{t_n}, k=3,4 where n, ti are natural numbers and a, a_i are fixed arbitrary rational numbers. We try to transform…

数论 · 数学 2017-03-01 Farzali Izadi , Mehdi Baghalaghdam

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…

数论 · 数学 2022-04-14 Philippe Michaud-Jacobs

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

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
‹ 上一页 1 2 3 10 下一页 ›