Aspects of Fibonacci numbers
Author
Yücel, Gülnihal
Advisor
Yıldırım, Yalçın
Date
1994Publisher
Bilkent University
Language
English
Type
ThesisItem Usage Stats
42
views
views
21
downloads
downloads
Metadata
Show full item recordAbstract
This thesis consists of two parts. The first part, which is Chapter 2, is
a survey on some aspects of Fibonacci numbers. In this part, we tried to
gather some interesting properties of these numbers and some topics related to
the Fibonacci sequence from various references, so that the reader may get an
overview of the subject. After giving the basic concepts about the Fibonacci
numbers, their arithmetical properties are studied. These include divisibility
and periodicity properties, the Zeckendorf Theorem, Fibonacci trees and their
relations to the representations of integers, polynomials used for deriving new
identities for Fibonacci numbers and Fibonacci groups. Also in Chapter 2, natural
phenomena related to the golden section, such as certain plants having Fibonacci
numbers for the number of petals, or the relations of generations of bees with the
Fibonacci numbers are recounted.
In the second part of the thesis. Chapter 3, we focused on a Fibonacci based
random number sequence. We analyzed and criticized the generator Sfc = k(j>—[k(j)]
by applying some standart tests for randomness on it.
Chapter 5, the Appendix consists of Fortran programs used for executing the
tests of Chapter 3.
Keywords
Fibonacci numbersGolden section
golden rectangle
Binet form
Fibonacci representation
Zeckendorf theorem
Fibonacci tree
tree codes
Pell polynomials
Pell Lucas polynomials
Pell diagonal functions
Fibonacci Polynomials
Lucas Polynomials
Fibonacci groups
random number
independent
uniform
QA241 .Y83 1994
Fibonacci numbers.
Golden section.
Permalink
http://hdl.handle.net/11693/17575Collections
Related items
Showing items related by title, author, creator and subject.

On a conjecture of Ilmonen, Haukkanen and Merikoski concerning the smallest eigenvalues of certain GCD related matrices
Altinişik, E.; Keskin, A.; Yildiz, M.; Demirbüken, M. (Elsevier Inc., 2016)Let Kn be the set of all n×n lower triangular (0,1)matrices with each diagonal element equal to 1, Ln={YYT:Y ∈ Kn} and let cn be the minimum of the smallest eigenvalue of YYT as Y goes through Kn. The IlmonenHaukkanenMerikoski ... 
Quantum stereographic projection and the homographic oscillator
Hakioǧlu T.; Arik, M. (American Physical Society, 1996)The quantum deformation created by the stenographic mapping from S2 to C is studied. It is shown that the resulting algebra is locally isomorphic to su(2) and is an unconventional deformation of which the undeformed limit ... 
Efficient algorithms for the minimum cost perfect matching problem on general graphs
Atamtürk, Alper (Bilkent University, 1993)The minimum cost perfect matching problem is one of the rare combinatorial optimization problems for which polynomial time algorithms exist. Matching algorithms find applications in Postman Problem, Planar Multicommodity ...