Investigating Fibonacci Sequence Properties for Theoretical Computer Science

Chia-Long Wu ； Ching-Seh Wu

《危機管理學刊》 2卷1期 (2005/03) Pp. 19-26

https://doi.org/10.6459/JCM.200503_2(1).0003

並列摘要

The Fibonacci sequence has played dominant roles in many branches of science and engineering. This sequence not only has an amazing number of applications in nature, but also has a tremendous number of interesting properties. The main object of this paper is to propose a systematic investigation of the familiar Fibonacci sequence in number theory and present a heuristic derivation of their properties. In this paper, we not only analyze the basic concepts and definitions of recurrence functions, generating functions, continued fractions, the Golden ratio, and primality test, but also give detailed analysis and further discussions for them with a different point of view when they incorporated with the Fibonacci sequence. Based on these concepts and definitions, we engage to contribute exact theorem descriptions and proofs. Moreover, extended properties including recurrence relations, summation formulas, and primality proving issues related to Fibonacci sequence are systematically studied and further explored.

並列關鍵字

Algorithmic number theory ； elementary cryptography ； information science ； primality proving ； recurrence relation

參考文獻

Bender, C.(1994).Capacitive ladder networks.41(8),557-558.

Yan, S. Y.(2000).Number Theory for Computing.New York:Springer-Verlag.

Knuth, D. E.(1997).The Art of Computer Programming, Volume 2: Seminumerical Algorithms, Addison Wesley.

Guy, R. K.(1994).Unsolved Problems in Number Theory.New York:Springer-Verlag.

Karatsuba, A. A.(1995).Complex Analysis in Number Theory, CRC.