2000 character limit reached
A refined modular approach to the Diophantine equation $x^2+y^{2n}=z^3$ (1002.0020v1)
Published 29 Jan 2010 in math.NT and math.AG
Abstract: Let $n$ be a positive integer and consider the Diophantine equation of generalized Fermat type $x2+y{2n}=z3$ in nonzero coprime integer unknowns $x,y,z$. Using methods of modular forms and Galois representations for approaching Diophantine equations, we show that for $n \in {5, 31}$ there are no solutions to this equation. Combining this with previously known results, this allows a complete description of all solutions to the Diophantine equation above for $n \leq 107$. Finally, we show that there are also no solutions for $n\equiv -1 \pmod{6}$.
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.