On the Diophantine Equation pˣ + (p + 5k)ʸ = z²

With the use of modular arithmetic and other fundamental number theoretic methods, as well as the concepts of floor function and the principle of mathematical induction, this study searches for possible nonnegative integer solutions of exponential Diophantine equations of the form pˣ + (p+5k)ʸ = z², where k ∈ N. Results are obtained for the following cases: {itemize} [a)] when $p =2$; or [b)] when p and $p + 5k$ are prime pairs. In addition, the study is limited only to solutions where x and y are not both greater than 1.