This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Let ℕ be the set of all positive integers. In this paper, using some known results on various types of Diophantine equations, we solve a couple of special cases of the ternary equation x2 − y2m = zn, x, y, z, m, n ∈ ℕ, gcd(x, y) = 1, m ≥ 2, n ≥ 3.