On the diophantine equation \({(ax^ m-1) \over{} (abx-1)} = by^ 2\) (Q1179321)

In this note the author proves: (1) If \(a\), \(b\) are positive integers, then the diophantine equation \((ax^ m-1)/(abx-1)=by^ 2\), \(2\nmid m>1\) has only the solutions in positive integers \(x=y=1\) (when \(a>1\), \(b=1\)) and \(m=4s+1\), \(x=3\), \(y=3^{2s}+2\) (when \(a=(1/4)(3^{2s-1}+1)\), \(b=1\)) where \(s\) is a positive integer. (2) If \(a\), \(b\) are positive integers, then the diophantine equation \((ax^ m+1)/(abx+1)=by^ 2\), \(2\nmid m>1\) has only solutions in positive integers \(x=y=1\) (when b=1) and \(m=4s+3\), \(x=3\), \(y=3^{2s+1}- 2\) (when \(a=(1/4)(3^{2s}-1)\), \(b=1\)), where \(s\) is a positive integer.