Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the Exponential Diophantine Equation $(a^2-2)(b^2-2)=x^2$ (1801.04770v1)

Published 15 Jan 2018 in math.NT

Abstract: In this paper, we consider the equation $(an-2{m})(bn-2{m})=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)((2P_k)n-2)=x2$ has only the solution $(n,x)=(2,Q_k)$, where $k>3$ is odd and $P_k,Q_k$ 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$.

Summary

We haven't generated a summary for this paper yet.