Pure mathematics

Biology

Discrete mathematics

Diophantine approximation

Computer science

Integer (computer science)

Paleontology

Physics

Mathematics

Elementary proof

Exponential function

Mathematical analysis

Diophantine equation

Combinatorics

Conjecture

Programming language

Elementary theory

Chen

Algebra over a field

American Journal of Mathematical and Computer Modelling

In 1956, Je_smanowicz conjectured that, for positive integers m and n with m > n; gcd(m; n) = 1 and m ≢ n (mod 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 proved the conjecture if 4 ☓mn and y ≥ 2. In this paper, we provide a proposition that, for positive integers m and n with m > n; gcd(m; n) = 1 and m2 + n2 ≡ 5 (mod 8), the exponential Diophantine equation (m2 -n2)x + (2mn)y = (m2 + n2)z has only the positive integer solution x = y = z = 2 with 2j gcd(x; y). Then we present an elementary and simple proof of the result of Ma and Chen by using Jacobi’s symbols.

An Elementary Proof of a Result Ma and Chen