Solving Fermat-type equations x5+y5=dzp
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 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.