On the Exponential Diophantine Equation (a2-2)(b2-2)=x2
Abstract
In this paper, we consider the equation (an-2m)(bn-2m)=x2. By assuming the abc conjecture is true, in [8], Luca and Walsh gave a theorem, which implies that the above equation has only finitely many solutions n,x if a and b are different fixed positive integers. We solve the above equation when m=1 and (a,b)=(2,10),(4,100),(10,58),(3,45). Moreover, we show that (a2-2)(b2-2)=x2 has no solution n,x if 2|n and gcd(a,b)=1. We also give a conjecture which says that the equation (22-2)((2Pk)n-2)=x2 has only the solution (n,x)=(2,Qk), where k>3 is odd and Pk,Qk are Pell and Pell Lucas numbers, respectively. We also conjecture that if the equation (a2-2)(b2-2)=x2 has a solution n,x, then n<7, where 2<a<b.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.