On the equation \(ax^ m - by^ n = 2\) (Q1176003)

For given integers \(2\neq a>0\), \(b>0\), \(x>1\) and \(y>1\), let \(N_ 2(m,n)\) be the number of solutions \((m,n)\) of the diophantine equation \[ ax^ m- by^ n=2, \quad m>1, \quad n>1.\tag{1} \] In this letter the following theorems are stated: Theorem 1. \(N_ 2(m,n)\leq 4\). Theorem 2. If \(a,b\in\mathbb{N}\), then the diophantine equation \[ ax^ 2={{by^ n+2} \over {aby+2}}, \qquad 2 \nmid n>2 \] only has solutions in positive integers \(x=y=1\) (when \(a=1\)) and \(x=3^{(n-1)/2}-2\), \(y=3\) (when \(a=1\), \(b={1\over 2}(3^{(n-3)/2}-1))\). Theorem 3. If \(a,b\in\mathbb{N}\), then the diophantine equation \[ ax^ 2={{by^ n-2} \over {aby-2}}, \qquad 2 \nmid n>1 \] only has solutions in positive integers \(x=y=1\) (when \(a=1\), \(b\neq 2\)) and \(x=3^{(n-1)/2}+2\), \(y=3\) (when \(a=1\), \(b={1\over 2}(3^{(n-3)/2}+1))\).