We study the Diophantine equationformula herein integers x, y > 1, n > 2 and q [ges ] 2.
Without loss of generality, we suppose that q is prime.Saradha and Shorey [SS] considered equation (1·1) with
x = z2 and proved that it has no solutions in the cases
z > 31 or z ∈ {2, 3, 4, 8, 9, 16, 27}.
Notice that the proof for z ∈ {2, 4, 8, 16} is elementary,
whereas for z ∈ {3, 9, 27} the proof uses a result of Darmon–Merel
[DM] which is a generalization of Wiles' result on Fermat's
theorem. The purpose of the present paper is to treat completely the remaining cases
and to prove the following result.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.