正Fibonacci数的标准分解式中因子2的指数

Fibonacci数列 {Fn}定义如下 :F0 =0 ,F1 =1,Fn + 1 =Fn +Fn -1 (n =1,2 ,… ) ,我们把 {Fn}中每一项Fn 叫做一个Fibonacci数 ,当n≥ 1时 ,称Fn 为正Fibonacci数 .关于正Fibonacci数的奇偶性及其中偶Fibonacci数中因子 2的指数 ,笔者在文 [1]中已有部分结果 (见下文中引理 1) ,即正Fibonacci数Fn 的奇偶性 ,由其下标n是否含因子 3来确定 ,且当n是一个奇数的 3倍时 ,Fn 的标准分解式中 ,因子 2的指数确定为1.本文所做的工作 ,是利用同余的知识 ,对于n是一个正偶数的 3倍时 ,Fn 的标准分解式中因子 2的指数给出一个准确的结果 .定理 1…     

正Fibonacci数的标准分解式中因子5的指数

根据Fibonacci数列的定义,利用初等数论的知识和数学归纳法,讨论了正Fibonacci数Fn的标准分解式中因子5的指数与下标n的关系,得到下列结论:正Fibonacci数Fn的标准分解式中因子5的指数,与下标n的标准分解式中因子5的指数一致.     

Fibonacci三角形

利用 Pell方程和递推序列的方法证明了在 k=1 ,2 ,3 ,4,5时 ,以 Fibonacci数 Fn,Fn,Fn- k为边的Fibonacci三角形不存在 .     

k=2t·3时不存在以(Fn-k,Fn,Fn)为边长的Fibonacci三角形

Fibonacci三角形是边长为Fibonacci数、面积为整数的三角形.利用平方剩余的方法得到:当k=2'·3时,不存在边长为(Fn-k,Fn,Fn)的Fibonacci三角形(k＜2).     

Fibonacci数列与三道不等式的指数推广

著名的斐波那契 (Fibonacci)数列具有以下一个重要性质 :设 F1 =F2 =1 ,Fn 2 =Fn 1 Fn,n≥ 1 ,则Fn 3 =2 Fn 1 Fn.文 [1 ] [2 ] [3] [4]曾先后涉及到三道不等式 ,笔者发现其字母指数恰按斐波那契数列呈现 .请看 :问题 1　 (第 2 6届 USAMO赛题 )证明对所有正实数 a、b、c     

Fibonacci数的一组整除特征

Fibonacci数列 {Fn}定义如下 :F0 =0 ,F1=1 ,Fn +1=Fn+Fn - 1(n =1 ,2 ,… ,) ,我们把{Fn}中每一项Fn 叫做一个Fibonacci数 .本文将讨论Fibonacci数Fn 被某些整数整除的特征 .在其证明过程中所用到的关于整除、最大公约数、最小公倍数以及同余的一些简单性质 ,恕不一一列作引理 .此外 ,证明过程中还用到下列数据 :F0 =0 ,F1=1 ,F3=2 ,F4 =3,F5=5,F9=34,F10 =55,F15=6 1 0 ,F16 =987,F2 7=1 96 41 8,F2 8=31 781 1 ,等等 ,这些数据 ,都不难利用Fibonacci数列的定义直接计算得到 .以下的引理是后面定理的证明过程所必须的 .引理 1 […     

关于连乘积末尾零的个数

1×2×3×…×100积的末尾有多少零呢? 我们知道,一个2和一个5相乘,积的末尾有一个0;两个2与两个5相乘,积的末尾有两个0,…要确定连乘积末尾零的个数,就得搞清连乘积中因子2与因子5的个数.当因子2与因子5的个数不等时,多余的因子就不会使积的末尾的零增加.在1×2×3×…×100的积中,显然2的个数多于5的个数,因此,求其连乘积末尾零的个数,实际上就是求1到100这一百个连续自然数中含5的总个数. 在连续自然数中.从1数起,每5个数.恰有一个数至少含有一个5;每5~2个数,恰有一个数至少含有两个5……因此,我们只要用100除以5,就能得到至     

利用Fibonacci数列解题

Fibonacci数列本身就有很大的魅力 ,吸引着许多数学爱好者去学习和研究 .这里我们将视角定位在如何利用该数列去解决一些数学竞赛中的问题 .Fibonacci数列是指由下面的递推式定义的数列 {Fn}:F0 =F1 =1,Fn + 2 =Fn+ 1 +Fn ,n =0 ,1,2 ,…可以利用特征方程的方法求出其通项公式 ,也可以用数学归纳法证出其许许多多的性质 .但在这里我们更多的是用到其本身 ,而不是它的性质 .例 1(第 5 2届波兰数学竞赛试题 )　考虑数列 {xn}:x1 =a ,x2 =b ,xn + 2 =xn + 1 +xn,n =1,2 ,… ,这里a ,b∈R .对任意c∈R ,如果存在k ,l∈N ,k≠l ,使得xk =xl=…     

Fibonacci数列的模数列的周期性

对于Fibonacci数列{Fn}以及给定的正整数m,由Fn关于模m的最小非负剩余an,构成一个新的数列{an},称为Fibonacci数列的模数列.本文利用初等数论的知识和数学归纳法,证明了Fibonacci数列的模数列是周期数列,并且是纯周期数列.     

色多项式的显示公式

本文利用完全图K_n恰有k个分支S~((n))={K_i∶1≤i≤n}-因子个数N(K_n,k)及第二类Stirling数S(n,k)之间关系,导出图的色多项式的显示公式刻画,并给出几类色多项式及用Stirling数表示的完全i部图的色多项式的显式公式。     

探索以(Fn-k,Fn,Fn)为边长的Fibonacci三角形

Fibonacci三角形是边长为Fibonacci数、面积为整数的三角形.存在以(F<,n-k>,F<,n>.F<,n>)为边长的Fibonacci三角形的情形可以被划分为三类(k时,不存在边长为(F<,n-k>,F<,n>.F<,n>)的Fibonacci三角形.     

Generalized Fibonacci recurrences and the lex-least de Bruijn sequence

The skew of a binary string is the difference between the number of zeroes and the number of ones, while the length of the string is the sum of these two numbers. We consider certain suffixes of the lexicographically-least de Bruijn sequence at natural breakpoints of the binary string. We show that the skew and length of these suffixes are enumerated by sequences generalizing the Fibonacci and Lucas numbers, respectively.     

Fibonacci数列的模数列的周期的一个性质

Fibonacci数列的模数列是周期数列,并且是纯周期数列.利用模数列的定义,讨论了Fibonacci数列的模数列的周期的一个性质,证明了下列结果:假设m1与m2为不同的正整数,Fibonacci数列{Fn}的模数列{an(m1)}与{an(m2)}的最小正周期分别为T1与T2,则模数列{an([m1,m2])}的最小正周期为[T1,T2].     

First Observations on Prefab Posets’ Whitney Numbers

We introduce a natural partial order ≤ in structurally natural finite subsets of the cobweb prefabs sets recently constructed by the present author. Whitney numbers of the second kind of the corresponding subposet which constitute Stirling-like numbers’ triangular array — are then calculated and the explicit formula for them is provided. Next — in the second construction — we endow the set sums of prefabiants with such an another partial order that their Bell-like numbers include Fibonacci triad sequences introduced recently by the present author in order to extend famous relation between binomial Newton coefficients and Fibonacci numbers onto the infinity of their relatives among whom there are also the Fibonacci triad sequences and binomial-like coefficients (incidence coefficients included). The first partial order is F-sequence independent while the second partial order is F-sequence dependent where F is the so-called admissible sequence determining cobweb poset by construction. An F-determined cobweb poset’s Hasse diagram becomes Fibonacci tree sheathed with specific cobweb if the sequence F is chosen to be just the Fibonacci sequence. From the stand-point of linear algebra of formal series these are generating functions which stay for the so-called extended coherent states of quantum physics. This information is delivered in the last section. Presentation (November 2006) at the Gian-Carlo Rota Polish Seminar .     

The order of appearance of factorials in the Fibonacci sequence and certain Diophantine equations

Periodica Mathematica Hungarica - Let $$F_n$$ be the nth Fibonacci number. The order (or the rank) of appearance of m in the Fibonacci sequence, denoted by z(m), is the smallest positive integer k...     

以Fibonacci数为模的广义Fibonacci等距子列的周期

给出广义Fibonacci等距子列的定义,求出以Fibonacci数fm为模的模数列的周期,由此得到求广义Fibonacci数列模fm的周期的算法.     

Wythoff partizan subtraction

We introduce a class of normal-play partizan games, called Complementary Subtraction. These games are instances of Partizan Subtraction where we take any set A of positive integers to be Left’s subtraction set and let its complement be Right’s subtraction set. In wythoff partizan subtraction we take the set A and its complement B from wythoff nim, as the two subtraction sets. As a function of the heap size, the maximum size of the canonical forms grows quickly. However, the value of the heap is either a number or, in reduced canonical form, a switch. We find the switches by using properties of the Fibonacci word and standard Fibonacci representations of integers. Moreover, these switches are invariant under shifts by certain Fibonacci numbers. The values that are numbers, however, are distinct, and we can find their binary representation in polynomial time using a representation of integers as sums of Fibonacci numbers, known as the ternary (or “the even”) Fibonacci representation.