A refined modular approach to the Diophantine equation x2+y2n=z3
Abstract
Let n be a positive integer and consider the Diophantine equation of generalized Fermat type x2+y2n=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 ∈ \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 ≤ 107. Finally, we show that there are also no solutions for n -1 6.
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.