On the Diophantine Equation p^x + p^y = z²ⁿ

2017/09/06 by Dibyajyoti Deb, Deb, Dibyajyoti
Computer Science · Mathematics · Physics and Astronomy · #Advanced Mathematical Theories and Applications #Algebraic Geometry and Number Theory #Chaos-based Image/Signal Encryption #FOS: Mathematics #Number Theory (math.NT)

paper · pdf · doi:10.48550/arxiv.1709.01814

openalex publication_date 2017/09/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In an earlier paper, Tatong and Suvarnamani explores the Diophantine equation p^x + p^y = z² for a prime number p. In that paper they find some solutions to the equation for p=2, 3. In this paper, we look at a general version of this equation and solve it completely.

Related

• On The Solutions of The Equation (4ⁿ)^x+p^y=z²
• On the Diophantine equation X^2N + 2^{2 alpha} 5^{2 beta} p^{2 gamma} = Z⁵
• Elementary treatment of p^a ± p^b + 1 = x²
• Solution of the Diophantine equation x² + p^k=yⁿ
• Note on the diophantine equation X^t+Y^t=BZ^t