Fibonacci数列的模数列的周期性

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

取整函数及其生成的数列

讨论三类整数列，这些数列的后项均是由前项与非整数乘积再取整后得到的，对应的取整函数分别为四舍五入取整函数、下取整函数、上取整函数．结果表明这三类整数列均为二阶线性递归数列．     

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

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

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

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

Fibonacci数列和黄金比

黄金比1+5_(1/2)/2和Fibonacci数列1,1,2,3,5,8,13,21,···之间存在着一个著名关系,若以F_n表示Fibonacci数列的第n项,则可用下式来定义Fibonacci数列:     

四类取整数列通项性质的探究与应用

函数f（x）：[x]（x∈R）表示不超过实数x的最大整数,称为取整函数．定义在正整数集上的某些类型取整数列的通项是否具有一些特有的性质呢？利用这些类型取整数列的通项性质可以表示哪些类型数列的通项公式呢？笔者发现在近年来的高考和竞赛试题中经常可以找到此类数列问题的影子!本文将展开四类取整数列通项性质的探究,以实例说明其应用．     

一些取整数列求和公式及应用

一些取整数列求和公式及应用秦宗慈（镇江高专数理系２１２００３）由取整函数［Ｘ］产生的数列可称作取整数列．关于取整数列的求和，我们已经知道等［１］．本文将证明另外一些求和公式，其中一切字母表示自然数．在公式④中，令ｓ＝２，ｍ＝ｌ便得①；令ｓ＝２，ｍ＝２...     

关于Fibonacci数列的概率性质

本文对Fibonacci数列性质进行了深入一步的讨论.给出并证明了Fibonacci数列的一个有趣的概率性质.从而在相当大的程度上推广了文献中的有关结果.     

再论Fibonacci数列的概率性质

本文得到了从Fibonacci数列｛F_n｝~∞_n=1中(有放回)随机取m(≥2)项其最大公因子为F_(no≥3)的概率;讨论了Mersenne数列｛2~n-1｝~∞_n=1的概率性质,并发现它与Fibonacci数列的概率性质相似．     

关于Lucas数列同余性质的研究

将二项式系数的性质应用到Lucas数列的研究中,并结合Fibonacci数列与Lucas数列的恒等式得到几个有趣的Lucas数列的同余式.     

关于斐波那契数列倒数的无限和

In this paper,we consider infinite sums of the reciprocals of the Fibonacci numbers.Then applying the floor function to the reciprocals of this sums,we obtain a new identity involving the Fibonacci numbers.     

The infinite sum of reciprocal Pell numbers

In this paper, we consider infinite sums derived from the reciprocals of the Pell numbers. Then applying the floor function to the reciprocals of this sums, we obtain a new and interesting identity involving the Pell numbers.     

Inverse polynomial expansions of Laurent series

An algorithm is introduced, and shown to lead to various unique series expansions of formal Laurent series, as the sums of reciprocals of polynomials. The degrees of approximation by the rational functions which are the partial sums of these series are investigated. The types of series corresponding to rational functions themselves are also characterized.     

Sums of reciprocals of certain additive functions

We obtain sharp estimates for sums of reciprocals and sums of quotients of certain non-negative integer-valued additive arithmetical functions.Research financed by the Mathematical Institute of Belgrade and Republika Zaj. of Serbia     

Infinite series representations for complex numbers

We introduce two new algorithms that lead to finite or infinite series expansions for complex number in terms of ‘integral digits’ within the complex quadratic fields ? \(\left( {\sqrt { - m} } \right)\) , form=1, 2,…, 11. In particular, we derive complex number representations as sums of reciprocal of Gaussion integers and as sums of reciprocals of algebraic integers in ? \(\left( {\sqrt { - m} } \right)\) , form=2, 3, 7 and 11. In addition to convergence of the various algorithms we investigate the representation of ‘rationals’ relative to the fields ? \(\left( {\sqrt { - m} } \right)\) , form=1, 2, 3, 7 and 11.     

二项式系数倒数级数恒等式

利用已知级数,通过裂项构造出一批新的二项式系数倒数级数,它们的分母分别含有1到4个奇因子与二项式系数的乘积表达式.所给出二项式系数倒数级数的和式是封闭形的.     

A note on some relations among special sums of reciprocals modulo <Emphasis Type="Italic">p</Emphasis>

In this note the sums s(k, N) of reciprocals are investigated, where p is an odd prime, N, k are integers, p does not divide N, N ≥ 1 and 0 ≤ k ≤ N − 1. Some linear relations for these sums are derived using “logarithmic property” and Lerch’s Theorem on the Fermat quotient. Particularly in case N = 10 another linear relation is shown by means of Williams’ congruences for the Fibonacci numbers. Published results were acquired using the subsidization of the Ministry of Education, Youth and Sports of the Czech Republic, research plan MSM 0021630518 “Simulation modeling of mechatronic systems”.     

On the Convergence of Series of Reciprocals of Primes Related to the Fermat Numbers

We examine densities of several sets connected with the Fermat numbers F_m=2^2m+1. In particular, we prove that the series of reciprocals of all prime divisors of Fermat numbers is convergent. We also show that the series of reciprocals of elite primes is convergent.     

On Products of Shifted Primes

Any rational representable as a product of shifted primes p+1 or their reciprocals, has a representation with exactly 19 terms.     

Uniform reciprocal approximation subject to coefficient constraints

In this paper best approximation by reciprocals of functions of a subspace U_n=span (u₁,...,u_n) satisfying coefficient constraints is considered. We present a characterization of best approximations. When (u₁,...,u_n) is a Descartes system an explicit characterization of best approximations by equioscillations is given. Existence and uniqueness results are shown. Moreover, the theory is applied to best approximaitons by reciprocals of polynomials.