On the diophantine equation x 2 + p 2 k = y n

摘要

Let 2 ≤ p 0, y > 1, n ≥ 3 prime, k ≥ 0 and gcd(x, y) = 1. Under the above conditions we give all solutions of the title equation (see the Theorem). We note that if in (3) gcd(x, y) = 1, our Theorem is an extension of several earlier results [15], [27], [2], [3], [5], [23].