Ask a Question

Prefer a chat interface with context about you and your work?

THE EXPONENTIAL DIOPHANTINE EQUATION <i>n<sup>x</sup></i> + (<i>n</i> + 1)<sup><i>y</i></sup> = (<i>n</i> + 2)<sup><i>z</i></sup> REVISITED

THE EXPONENTIAL DIOPHANTINE EQUATION <i>n<sup>x</sup></i> + (<i>n</i> + 1)<sup><i>y</i></sup> = (<i>n</i> + 2)<sup><i>z</i></sup> REVISITED

Abstract Let n be a positive integer. In this paper, we consider the diophantine equation We prove that this equation has only the positive integer solutions ( n , x , y , z ) = (1, t , 1, 1), (1, t , 3, 2), (3, 2, 2, 2). …