The Diophantine equation
Recently, Miyazaki and Togbé proved that for any fixed odd integer b ≥ 5 with b ≠ 89, the Diophantine equation has only the solution (x,y,z) = (1,1,1). We give an extension of this result.
Recently, Miyazaki and Togbé proved that for any fixed odd integer b ≥ 5 with b ≠ 89, the Diophantine equation has only the solution (x,y,z) = (1,1,1). We give an extension of this result.
It is shown that for a given squarefree positive integer D, the equation of the title has no solutions in integers x > 0, m > 0, n ≥ 3 and y odd, nor unless D ≡ 14 (mod 16) in integers x > 0, m = 0, n ≥ 3, y > 0, provided in each case that n does not divide the class number of the imaginary quadratic field containing √(-2D), except for a small number of (stated) exceptions.
Let , be the sets of all integers and positive integers, respectively. Let be a fixed odd prime. Recently, there have been many papers concerned with solutions of the equation , , , , , , And all solutions of it have been determined for the cases , , and . In this paper, we mainly concentrate on the case , and using certain recent results on exponential diophantine equations including the famous Catalan equation, all solutions of the equation , , , , , , , are determined....
We consider , the number of solutions to the equation in nonnegative integers and integers , for given integers , , , and . When , we show that except for a finite number of cases all of which satisfy for each solution; when , we show that except for three infinite families of exceptional cases. We find several different ways to generate an infinite number of cases giving solutions.