A generalization of a theorem of Cohn on the equation \(x^3-Ny^2=\pm 1\) (Q5948863)

In [The Diophantine equation \(x^3=Ny^2\pm 1\), Q. J. Math., Oxf. (2) 42, 27-30 (1991; Zbl 0722.11019)] \textit{J. H. E. Cohn} completely solves the title equation in integers \(x\) and \(y\) for all squarefree \(N\), also free of prime factors of the form \(3k+1\). In the present paper the authors generalize Cohn's result by considering the following two classes of elliptic curves NEWLINE\[NEWLINEz^2=Aw^4\pm Bw^2+C,NEWLINE\]NEWLINE where \(A=dN^2\), \(B=dUN\) and \(C=({1\over 2}T)^2\) for a given positive integer \(d\equiv 3\pmod 4\), minimal solution \(T+U\sqrt d>1\) to the Pellian equation \(X^2-dY^2=1\) \((T\) is assumed even), and squarefree \(N> 0\), not divisible by any odd prime \(p\) with \((-{d\over p})=1\). The authors find all integer points on these curves. Their method depends on the properties of the recurrence sequences \((T_k)\) and \((U_k)\) given by \(T_k+U_k \sqrt d= (T+U \sqrt d)^k\) for positive integers, \(k\).