Levy, Dan The irreducible factorization of Fibonacci polynomials over \(\mathbb Q\). (English) Zbl 1009.11012 Fibonacci Q. 39, No. 4, 309-319 (2001). \(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. Reviewer: J.Piehler (Merseburg) Cited in 8 Documents MSC: 11B39 Fibonacci and Lucas numbers and polynomials and generalizations 11B83 Special sequences and polynomials 12E05 Polynomials in general fields (irreducibility, etc.) Keywords:Fibonacci polynomials; prime factorization PDFBibTeX XMLCite \textit{D. Levy}, Fibonacci Q. 39, No. 4, 309--319 (2001; Zbl 1009.11012)