scientific article; zbMATH DE number 1471880

Let \(a,b\in\mathbb{N}\) with \(a>1\), \(b>1\) and \(b\) square-free. In [J. Harbin Inst. Tech. 1988, No. 3, 1-7 (1988; Zbl 0971.11502)] the reviewer proved that if the equation \(x^4+1=by^2\) has a solution in positive integers \(x,y\), then \(x^2+y\sqrt b=\eta^d\), where \(\eta=u_0+v_0\sqrt b\) is the fundamental solution of \(u^2-bv^2=-1, u_0=du_1^2,d\) square-free. Using the same method, the reviewer [J. Harbin Inst. Tech., New Ser. 5, No. 2, 1-3 (1998)] also proved that the equation \(ax^4+1=by^2\) has a solution in positive integers \(x,y\) if and only if the equation \(au^2-bv^2=-1\) has a solution in positive integers \((u,v)\) and its least solution \(u_0\sqrt a+v_0\sqrt b\) satisfies \(u_0=du_1^2\), \(d\) is odd square-free and \((u_0\sqrt a+v_0\sqrt b)^d=x_1^2\sqrt a+y_1\sqrt b\), where \(x_1, y_1\) are positive integers. Furthermore, if \(a\) is an odd square and \(ax^4+1=by^2\) has a solution in positive integers \(x,y\), then \[ x^2\sqrt a+y\sqrt b=(u_0\sqrt a+v_0\sqrt b)^d, u_0=du_1^2, d \text{ is odd square-free}.\tag{1} \] The reviewer remarks that \textit{J. H. E. Cohn} also obtained the above first result in 1997 [Math. Comput. 66, 1347-1351 (1997; Zbl 0874.11031)]. In this paper, the author proves that if \(au_0^2>1000\), then (1) holds for any \(a\). In the proof of the result, the author mainly uses some techniques in Diophantine approximation. Reviewer's remark: There are some important misprints in the paper.

Recommendations

Cited in

(6)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4488967)