No label defined (Q4398232)
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 1175372
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1175372 |
Statements
8 April 1999
0 references
quintic polynomials
0 references
Gauss's class number problem
0 references
Fibonacci numbers
0 references
imaginary quadratic fields
0 references
cubes in the Fibonacci sequence
0 references
0.9276518821716307
0 references
0.8622116446495056
0 references
\textit{S. Rabinowitz} [Math. Mag. 61, 191-193 (1988; Zbl 0649.10010)] proved the following results, the proofs of which depend on the well-known result of \textit{J. H. E. Cohn} [J. Lond. Math. Soc. 39, 537-540 (1964; Zbl 0127.26705)] that the only Fibonacci numbers that are squares are 0, 1 and 144: (1). The only integers \(n\) for which \(x^5+x+n\) factors into the product of an irreducible quadratic and an irreducible cubic are \(n=\pm 1\) and \(n=\pm 6\). (2). The only integers \(n\) for which \(x^5-x+n\) factors into the product of an irreducible quadratic and an irreducible cubic are \(n=\pm 15\), \(n=\pm 22440\), and \(n= 2759640\). In the present paper the authors investigate the corresponding problems with \(x\) replaced by \(x^2\), \(x^3\) and \(x^4\). Their results are as follows: (1) The only integers for which \(x^5+x^2+n\) factors into the product of an irreducible quadratic and an irreducible cubic are \(n=-90\), \(-4\), 18 and 11466. (2) The only integers \(n\) for which \(x^5- x^2+n\) factors into the product of an irreducible quadratic and an irreducible cubic are \(n=90\), 4, \(-18\) and \(-11466\). (3) The only integers \(n\) for which \(x^5-x^3+n\) factors into the product of an irreducible quadratic and an irreducible cubic are \(n=\pm 8\). (4) There are no integers \(n\) for which \(x^5+x^3+n\) factors into the product of an irreducible quadratic and an irreducible cubic. (5) There are infinitely many integers \(n\) for which \(x^5\pm x^4+n\) factors into the product of an irreducible quadratic and an irreducible cubic. These can be parametrised in terms of Fibonacci numbers. The proofs make use of Cohn's result cited above as well as the following two results: A) [\textit{H. London} and \textit{R. Finkelstein}, Fibonacci Q. 7, 476-481 (1969; Zbl 0206.05402)]. The only Fibonacci numbers that are cubes are 0, 1 and 8. B).If \(x\) and \(y\) are nonzero integers such that \(x^2-x y-y^2= \varepsilon\), where \(\varepsilon =\pm 1\), then there exists a positive integer \(k\) such that \(x=F_{k+1}\), \(y=F_k\), \(\varepsilon= (-1)^k\) if \(x\) and \(y\) are positive, with similar results in the other three possibilities for the signs of \(x\) and \(y\). In conclusion, it is known that the problem of solving Gauss's famous class number one problem for imaginary quadratic fields is equivalent to finding all the cubes in the Fibonacci sequence. Thus we have the pretty result that the solution of Gauss's problem is also equivalent to proving Theorem 2 of the present paper.
0 references