Solving Fermat-type equations x^5+y^5=dz^p
| dc.creator | Billerey, Nicolas | |
| dc.creator | Dieulefait, Luis | |
| dc.date | 2008-02-08 | |
| dc.date | 2008-06-11 | |
| dc.date.accessioned | 2026-07-07T09:43:29Z | |
| dc.date.available | 2026-07-07T09:43:29Z | |
| dc.description | 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 in a previous paper of the first author. We finally discuss the present limitations of the method by looking at the case d=3. | |
| dc.description | major revision: mistakes corrected, several new cases covered | |
| dc.identifier | https://arxiv.org/abs/0802.1217 | |
| dc.identifier | http://arxiv.org/abs/0802.1217 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/162577 | |
| dc.subject | Number Theory | |
| dc.title | Solving Fermat-type equations x^5+y^5=dz^p | |
| dc.type | text |