A note on the diophantine equation a<sup>2</sup>x<sup>4</sup>-By<sup>2</sup>=1 (Q4522895)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1548774
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the diophantine equation a<sup>2</sup>x<sup>4</sup>-By<sup>2</sup>=1 |
scientific article; zbMATH DE number 1548774 |
Statements
A note on the diophantine equation a<sup>2</sup>x<sup>4</sup>-By<sup>2</sup>=1 (English)
0 references
7 January 2001
0 references
quartic Diophantine equation
0 references
diophantine approximation
0 references
0.97520196
0 references
0.9689543
0 references
0.9633386
0 references
0.9595642
0 references
0.9539932
0 references
0.9498882
0 references
Let \(a,b\in{\mathbb{N}}\) with \(a>1,b>1\) and \(b\) square free. In 1942, \textit{W. Ljunggren} [Avh. Norske Vid. Akad. Oslo 1942, No.~5, 1-27 (1942; Zbl 0027.01103)] proved that the Diophantine equation (1) \(a^2x^4-by^2=1\) has at most one positive integer solution. In 1984, the reviewer [see \textit{Z. Cao}, J. Harbin Inst. Tech. 1988, No. 3, 1-7 (1988; Zbl 0971.11507)] proved that if the equation \(4x^4-by^2=1\) has a solution in positive integers \(x,y\), then \(2x^2+y\sqrt b=\eta\), where \(\eta=u_0+v_0\sqrt b\) is the fundamental solution of \(u^2-bv^2=1\). Using the lower bound result for linear forms in logarithms of two algebraic numbers, \textit{M. Le} [Acta Arith. 76, 1-9 (1996; Zbl 0869.11026)] proved that when \(\max(a^2,b)>2.374\cdot 10^{10}\), equation (1) has at most one positive integer solution. Recently, \textit{M. Bennett} and \textit{G. Walsh} [Proc. Am. Math. Soc. 127, 3481-3491 (1999; Zbl 0980.11021)] and the reviewer [Complete solution of the Diophantine equation \(A^2x^4-By^2=1\), J. Harbin Inst. Tech., New Ser. 8, No. 2, 108-110 (2001)] proved the following result, respectively: equation (1) has at most one solution \((x,y)\), and if such a solution exists, then \(ax^2+y\sqrt b=\eta_1\), where \(\eta_1=u_1\sqrt {a^2}+v_1\sqrt b\) is the least positive integer solution of \(a^2u^2-bv^2=1\). In the proof of Bennett and Walsh, they mainly used \textit{M. Bennett}'s result [see Acta Arith. 88, 363-370 (1999; Zbl 0928.11017)] and properties of the Jacobi symbol. The reviewer's method is simple and different, it only used the method of Le and the computer. In this paper, the author proves the same result using a result of \textit{J. Rickert} on Diophantine approximation [Math. Proc. Camb. Philos. Soc. 113, 461-472 (1993; Zbl 0786.11040)].
0 references