Zhu, HuilinLe, MaohuaSoydan, GökhanTogbe, Alain2024-08-132024-08-132015-06-010031-5303https://doi.org/10.1007/s10998-014-0073-9https://hdl.handle.net/11452/43965Let be an odd prime. In this paper we study the integer solutions(x, y, n, a, b) of the equation x(2) + 2(a) p(b) = y(n), x >= 1, y > 1, gcd(x, y) = 1, a >= 0, b >= 0, n >= 3.eninfo:eu-repo/semantics/closedAccessPrimitive divisorsLucasExponential diophantine equationPrimitive divisorLucas numberJacobi symbolScience & technologyPhysical sciencesMathematics, appliedMathematicsArticle000354204100008https://link.springer.com/article/10.1007/s10998-014-0073-923324770210.1007/s10998-014-0073-91588-2829