机构地区: 榆林学院数学与统计学院,陕西榆林719000
出 处: 《甘肃科学学报》 2017年第4期9-11,共3页
摘 要: Fibonacci多项式是以递推方式定义:F0(x)=1,F1(x)=x,Fn+2(x)=xFn+1(x)+Fn(x)。主要利用代数、组合方法,结合Fibonacci多项式的递推关系,证明了Fibonacci多项式的若干性质,得到了其性质的代数形式的证明。 The Fibonacci polynomial was defined by recursion:F0(x) = 1,F1 (x) =x,Fn+2 (x) =xFn+1 (x) +Fn(x).By using the algebraic and combinatorial methods, combined with the recurrence relations of Fibonacci polynomials, some properties of Fibonacci polynomials were proved, and the proofs of algebraic form of its properties were obtained.