1) Fibonacci type series
Fibonacci型数列
2) Fibonacci sequence
Fibonacci数列
1.
Varying-step correlation analysis and identification algorithm based on the Fibonacci sequence;
基于Fibonacci数列的变步长相关分析辨识算法
2.
Some properties of Lucas sequence and Fibonacci sequence;
Lucas数列和Fibonacci数列的几个性质
3.
Some properties of Fibonacci sequence;
Fibonacci数列的若干性质(英文)
3) sequence of Fibonacci number
Fibonacci数列
1.
The linear recursion of continuous k+2 numbers in the k-times sequence of Fibonacci number {F_n~k};
K次Fibonacci数列{F_n~k}中连续K+2个数的线性递推关系
2.
The sequence of Fibonacci number is a typical problem in recursion relation,The paper discusses that there exists linear connection among seven continuous numbers in the fifth of sequence of Fibonacci number.
Fibonacci数列是递推关系中的一个典型问题,文章讨论了5次Fibonacci数列中连续7个数之间存在线性关系并证明r,m≧6时,矩阵Am×r5的秩为6。
3.
The sequence of Fibonacci number is a typical problem in recursion relation.
Fibonacci数列是递推关系中的一个典型问题,问题本身虽然是一种假想,然而它的结果却有诸多用途。
4) Fibonacci sequences
Fibonacci数列
1.
On Some properties of the Chebyshev polynomials ahd the Fibonacci sequences;
关于Chebyshev多项式和Fibonacci数列的一些性质
2.
Making use of Fibonacci sequences s self-similarity and the sensitivity of logistic mapping to the initial value under chaotic condition, the Fibonacci sequence and chaotic mapping are mixed together to generate a chaotic pseudo-random sequence with logistic mapping as chaotic model.
利用Fibonacci数列本身的自相似性和Logistic映射在混沌状态下对初值的敏感性,以Logistic映射作为混沌模型,采用Fibonacci数列与混沌映射混合的方法产生混沌的伪随机数列。
5) Fibonacci series
Fibonacci数列
1.
Exploration of the Way in the Finding of the Formula of Fibonacci Series;
Fibonacci数列表达式发现探索
2.
Furthermore,by using Lucas series instead of Fibonacci series,we put forward the advanced Fibonacci searching method applied in optimization theory.
在介绍计算机代数系统Maple关于Fibonacci数列计算的基础上,提出了一种Fibonacci大数快速计算方法,并且提出了用Lucas数列代替Fibonacci数列,以改进Fibonacci搜索法,适用于最优化理论。
3.
According to the generalized Fibonacci series, the fractal dimention, Df(p,q)=lnN/2ln( ) is obtained for thecritical state, here p and q are the parameters relating to the human activity and the natu.
根据广义Fibonacci数列,得到临界状态时的分形维数D_t(p,q)=In N/2ln,其中p、q是与人类活动、环境因素有关的参数。
6) Fibonacci numbers
Fibonacci数列
1.
Some properties of a generalized Fibonacci numbers a_n;
广义Fibonacci数列a_n的若干性质
2.
In the paper,we calculated the complexity of Euclidean algorithm by using Fibonacci numbers.
利用Fibonacci数列,给出了求最大共因数的Euclidean算法的复杂度。
3.
Let F_n be Fibonacci numbers with F_n=F_(n-1)+F_(n-2),F_1=F_2=1.
设Fn表示Fibonacci数列,Fn=Fn-1+Fn-2,F1=F2=1,Ln表示Lucas数列,Ln=Ln-1+Ln-2,本文给出了F-L数列的卷积表达式n∑k=0FkLn-k和kn=∑0(-1)kFkLn-
补充资料：广义fibonacci数列
数列｛an｝称为广义fibonacci数列,如果其满足
1）数列中各项皆为正整数，
2）an=an-1+an-2, n≥3。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条