The irreducible factorization of Fibonacci polynomials over \(\mathbb Q\) (Q2746558)
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 1656219
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The irreducible factorization of Fibonacci polynomials over \(\mathbb Q\) |
scientific article; zbMATH DE number 1656219 |
Statements
2 July 2002
0 references
Fibonacci polynomials
0 references
prime factorization
0 references
The irreducible factorization of Fibonacci polynomials over \(\mathbb Q\) (English)
0 references
\(F_n(a,b)\) is defined by \(y_0=0\), \(y_1=1\), \(y_{n+1}= ay_n+ by_{n-1}\), \(n\geq 1\). Then \(F_n(x,1)= U_n(x)\) are the Fibonacci polynomials, and the main result of the paper is the prime factorization of \(U_n(x)\) over the field of rational numbers.
0 references
0.800682544708252
0 references
0.7872445583343506
0 references
0.7697774171829224
0 references
