2000 character limit reached
The Fermat-type equations x^5 + y^5 = 2z^p or 3z^p solved through Q-curves
Published 28 Mar 2011 in math.NT | (1103.5388v1)
Abstract: We solve the Diophantine equations $x5 + y5 = dzp$ with $d=2, 3$ for a set of prime numbers of density 1/4, 1/2, respectively. The method consists in relating a possible solution to another Diophantine equation and solving the later by using Q-curves and a generalized modular technique as in work of Ellenberg and Dieulefait-Jimenez along with some new techniques for eliminating newforms.
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.