共查询到11条相似文献,搜索用时 31 毫秒
1.
IBONACCISEQUENCEANDCANTOR′STERNARYSETTONGJINGCHENGSAMONS,J.ManuscriptreceivedSeptember12,1994.RevisedDecember15,1996.Depar... 相似文献
2.
3.
The following game is considered. The first player can take any number of stones, but not all the stones, from a single pile of stones. After that, each player can take at most n-times as many as the previous one. The player first unable to move loses and his opponent wins. Let f1,f2,… be an initial sequence of stones in increasing order, such that the second player has a winning strategy when play begins from a pile of size fi. It is proved that there exist constants c=c(n) and k0=k0(n) such that fk+1=fk+fk−c for all k>k0, and limn→∞ c(n)/(nlogn)=1. 相似文献
4.
5.
Devbhadra V. Shah Darshana A. Mehta 《International Journal of Mathematical Education in Science & Technology》2013,44(6):837-842
It is known that the ratios of consecutive terms of Fibonacci and Tribonacci sequences converge to the fixed ratio. In this article, we consider the generalized form of Tribonacci numbers and derive the ‘golden proportion’ for the whole family of this generalized sequence. 相似文献
6.
Fibonacci数列的模数列的周期性 总被引:5,自引:3,他引:5
袁明豪 《数学的实践与认识》2007,37(3):119-122
对于Fibonacci数列{Fn}以及给定的正整数m,由Fn关于模m的最小非负剩余an,构成一个新的数列{an},称为Fibonacci数列的模数列.本文利用初等数论的知识和数学归纳法,证明了Fibonacci数列的模数列是周期数列,并且是纯周期数列. 相似文献
7.
Martin Griffiths Surajit Rajagopal 《International Journal of Mathematical Education in Science & Technology》2016,47(1):139-144
In this article, we describe the outcome of a mathematical collaboration between a university lecturer and an undergraduate student. The resulting investigation concerned a particular divisibility property of the Fibonacci numbers, and indeed it seems that a new result was found in this regard. An interesting point to be made here is that, although the mathematical content was relatively straightforward, this joint exploration did, in a very modest sense, mirror certain key aspects of the research process. 相似文献
8.
Omer Yayenie 《Applied mathematics and computation》2011,217(12):5603-5611
9.
Xinyu Sun 《Discrete Mathematics》2005,300(1-3):180-195
Define a Wythoff's sequence as a sequence of pairs of integers (An,Bn) n>n0 such that there exists a finite set of integers T, An=mex( Ai,Bi:i<n T), Bn-An=n, and Bn ∩T=. Structural properties and behaviors of Wythoff's sequence are investigated. The main result is that for such a sequence, there always exists an integer α such that when n is large enough, |An-nφ-α|1, where , the golden section. The value of α can also be easily determined by a relatively small number of pairs in the sequence. As a corollary, the two conjectures on the N-heap Wythoff's game by Fraenkel [Complexity, appeal and challenges of combinatorial Games, Theoret. Comput. Sci. 313 (2004) 393–415] on the N-heaped Wythoff's game are proved to be equivalent. 相似文献
10.
广义的k阶Fibonacci-Jacobsthal序列及其性质 总被引:1,自引:0,他引:1
定义了一类广义的k阶Fibonacci-Jacobsthal序列,并给出了第四个初值条件.借助矩阵的方法得到了Jacobsthal序列与Jacobsthal-Lucas序列的关系,广义k阶Fibonacci-Jacobsthal序列与Jacobsthal序列,Fibonacci序列的关系,同时给出了k阶Fibonacc... 相似文献
11.
LI Hai-long LIU Hua-kel.Department of Mathematics Weinan Teacher''''s College Weinan China .College of Mathematics Information Science Henan University Kaifeng China 《数学季刊》2004,19(1):84-89
In this paper, we introduce a new counting function a(m) related to the Lucas number, then use conjecture and induction methods to give an exact formula Ar(N)=α(n), (r=1,2,3) and prove them. 相似文献