说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 正Fibonacci数
1)  positive Fibonacci Number
正Fibonacci数
1.
The relation between the exponent of factor 3 and the subscript n in the standard decomposition of positive Fibonacci Number: F\-n is presented.
给出了正Fibonacci数Fn 的标准分解式中因子 3的指数与下标n的关系 。
2)  Fibonacci numbers
Fibonacci数
1.
Some identities involving Fibonacci Numbers and Lucas Numbers;
有关Fibonacci数和Lucas数的几个恒等式
2.
Some identites involving the Fibonacci numbers and the lucas numbers;
一类包含Fibonacci数与Lucas数的恒等式
3.
A transformation from identities of Fibonacci numbers to congruence of Lucas numbers;
从Fibonacci数的恒等变换到Lucas数的同余式
3)  Fibonacci number
Fibonacci数
1.
A fast iterative algorithm for very large Fibonacci numbers;
超大Fibonacci数的快速迭代算法
2.
Identities involving 4 Fibonacci numbers with the subscript difference p~n;
下标公差为p~n的4个Fibonacci数的恒等式
3.
Some algorithms of Fibonacci number;
Fibonacci数的几种计算方法
4)  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数列的若干性质(英文)
5)  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数列是递推关系中的一个典型问题,问题本身虽然是一种假想,然而它的结果却有诸多用途。
6)  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数列与混沌映射混合的方法产生混沌的伪随机数列。
补充资料:Fibonacci search method
分子式:
CAS号:

性质:一种试验设计方法。该方法用于预先规定了试验次数n,参数的取值范围是不连续的,即只在有限个离散值上的情况(例如机床的转速分档等)。处理过程为:首先由递推公式:Fn=Fn-1+Fn-2(n≥2),F0=F1=1,定义数列[Fn]称为裴波那契(Fi-bonacci)数,将实验区间等分为Fn份。然后作分数Fn-1/Fn确定试验点的位置,与黄金分割法一样地分步骤进行优选,但用Fn+1/Fn代替0.618,在Fn-1/Fn处,即在第Fn-1份上。见下表。试验次数n2345678910…试验范围分段Fn3581321345589144…第一试验点的位置Fn-1/Fn2/33/55/88/1313/2121/3434/5555/8989/144…单边精度(±)1/31/51/81/131/211/341/551/891/144…

说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条