arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1002.0020math.NTmath.AG
收藏

丢番图方程$x^2+y^{2n}=z^3$的精细模方法

A refined modular approach to the Diophantine equation $x^2+y^{2n}=z^3$

Sander R. Dahmen

摘要:

设$n$为正整数,考虑广义Fermat型$x^2+y^{2n}=z^3$的丢番图方程,其未知数为非零互质整数$x,y,z$ .利用模形式和伽罗瓦表示方法逼近丢番图方程,我们证明了对于$n \in \{5, 31\}$,这个方程没有解。将其与先前已知的结果相结合,这允许完整描述上述$n \leq 10^7$的丢番图方程的所有解。最后,我们表明,也没有解决方案的$n\equiv -1 \pmod{6}$。

英文摘要:

Let $n$ be a positive integer and consider the Diophantine equation of generalized Fermat type $x^2+y^{2n}=z^3$ 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 10^7$. Finally, we show that there are also no solutions for $n\equiv -1 \pmod{6}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑