2000 character limit reached
An elementary proof of a result Ma and Chen
Published 1 Mar 2019 in math.NT | (1903.00121v1)
Abstract: In 1956, Je$\acute{s}$manowicz conjectured that, for positive integers $m$ and $n$ with $m>n, \, \gcd(m,\, n)=1$ and $m\not\equiv n\pmod{2}$, the exponential Diophantine equation $(m2-n2)x+(2mn)y=(m2+n2)z$ has only the positive integer solution $(x,\,y,\, z)=(2,\,2,\,2)$. Recently, Ma and Chen \cite{MC17} proved the conjecture if $4\not|mn$ and $y\ge2$. In this paper, we present an elementary proof of the result of Ma and Chen \cite{MC17}.
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.