Solving Fermat-type equations x^5+y^5=dz^p
From MaRDI portal
Publication:3584789
Abstract: 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 . We describe a new method based on modularity theorems which allows us to improve all the results in a previous paper of the first author. We finally discuss the present limitations of the method by looking at the case d=3.
Recommendations
- The Fermat-type equations \(x^5+y^5=2z^p\) or \(3z^p\) solved through \(\mathbb Q\)-curves
- Équations de Fermat de type (5, 5,p)
- The equation $(x-d)^5+x^5+(x+d)^5=y^n$
- A multi-Frey approach to Fermat equations of signature \((r,r,p)\)
- Solving Fermat-type equations via modular ℚ-curves over polyquadratic fields
Cites work
Cited in
(10)- The Fermat-type equations \(x^5+y^5=2z^p\) or \(3z^p\) solved through \(\mathbb Q\)-curves
- Équations de Fermat de type (5, 5,p)
- A multi-Frey approach to Fermat equations of signature \((r,r,p)\)
- Two results on 𝑥^{𝑟}+𝑦^{𝑟}=𝑑𝑧^{𝑝}
- On the equation \(a^2+b^{2p} = c^5\)
- Generalized Fermat equations: a miscellany
- Sur l'équation \(x^5 + y^5 = z^5\)
- Recipes to Fermat-type equations of the form \(x^r + y^r =Cz^p\)
- Bipowers in Number Fields
- Fermat-type equations of signature \((13,13,p)\) via Hilbert cuspforms
This page was built for publication: Solving Fermat-type equations \(x^5+y^5=dz^p\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3584789)
