2000 character limit reached
Solving Fermat-type equations x^5+y^5=dz^p
Published 8 Feb 2008 in math.NT | (0802.1217v2)
Abstract: In this paper we are interested in solving the Fermat-type equations x5+y5=dzp 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 in a previous paper of the first author. We finally discuss the present limitations of the method by looking at the case d=3.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.