2000 character limit reached
On the exponential Diophantine equation $(n-1)^{x}+(n+2)^{y}=n^{z}$
Published 28 Mar 2020 in math.NT | (2003.12749v1)
Abstract: Suppose that $n$ is a positive integer. In this paper, we show that the exponential Diophantine equation $$(n-1){x}+(n+2){y}=n{z},\ n\geq 2,\ xyz\neq 0$$ has only the positive integer solutions $(n,x,y,z)=(3,2,1,2), (3,1,2,3)$. The main tools on the proofs are Baker's theory and Bilu-Hanrot-Voutier's result on primitive divisors of Lucas numbers.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.