Solving Fermat-type equations x^5+y^5=dz^p
From MaRDI portal
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
Cites work
Cited in
(12)- Recipes to Fermat-type equations of the form x^r + y^r =Cz^p
- The Fermat-type equations x^5+y^5=2z^p or 3z^p solved through Q-curves
- Generalized Fermat equations: a miscellany
- On the equation \(a^2+b^{2p} = c^5\)
- Bipowers in Number Fields
- Fermat-type equations of signature \((13,13,p)\) via Hilbert cuspforms
- A multi-Frey approach to Fermat equations of signature (r,r,p)
- Équations de Fermat de type (5, 5,p)
- Two results on 𝑥^{𝑟}+𝑦^{𝑟}=𝑑𝑧^{𝑝}
- Asymptotic Fermat equation of signature (r, r, p) over totally real fields
- Generalized Fermat equation: a survey of solved cases
- Sur l'équation x^5 + y^5 = z^5
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)