Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 254 for “"Fibonacci"”.
-
Fibonacci Numbers
No abstract prepared.
-
Fibonacci Vectors
By the n-th Fibonacci (respectively Lucas) vector of length m, we mean the vector whose components are the n-th through (n+m-1)-st Fibonacci (respectively Lucas) numbers. For arbitrary m, we express the dot product of any two Fibonacci vectors, any two Lucas vectors, and any Fibonacci vector and …
-
Fibonacci sequences
… in the thirteenth century, Leonardo de Pisa, or, Fibonacci, introduced his famous rabbit problem, which may be stated simply as follows: assume that rabbits reproduce at a rate such that one pair is born each month from each pair of adults not less than two months old. If one pair is present …
-
The Fibonacci sequence
Electronic Thesis or Dissertation
-
Identities involving Fibonacci numbers
Not available
-
Fibonacci Numbers In Geometry
… paper is to give a summary of the history of Fibonacci numbers, and to consider some of the various Geometric applications of the series.
-
Fibonacci Numbers in Geometry
… paper is to give a summary of the history of Fibonacci numbers, and to consider some of the various Geometric applications of the series.
-
Chebyshev Polynomials and Fibonacci Numbers
… and Quinn. Another beautiful formula for the Fibonacci numbers involves complex roots of unity. Presently, no combinatorial proof is known. We give combinatorial proofs of some related identities as progress toward a full combinatorial proof.
-
Elgenvalues of Fibonacci-like Sequences
The familiar Fibonacci sequence 1,1,2,3,5,8,13,... can be described by the recurrence relation x(0) = 1, x(1) = 1, x(n) = x(n-1) + x(n-2). For this relation, as n → oo, x(n+1) → 1 +√5 x(n) 2 ' which is the familiar golden ratio. This value is also the dominant eigenvalue of the above recurrence …
-
Around the Fibonacci Numeration System
Let 1, 2, 3, 5, 8, … denote the Fibonacci sequence beginning with 1 and 2, and then setting each subsequent number to the sum of the two previous ones. Every positive integer n can be expressed as a sum of distinct Fibonacci numbers in one or more ways. Setting R(n) to be the number of ways n can …
-
Fibonacci čísla a jejich aplikace
Bakalářská práce se zabývá vybranými aplikacemi Fibonacci čísel a zlatého řezu. Práce je rozdělena na dvě hlavní části. První část zkoumá výskyt zlatého řezu v chemii. Konkrétně jde o poměr poloměrů atomů ve sloučeninách halogenidů alkalických kovů, asymetrické rysy chemických procesů, stabilitu …
-
Some Properties of the Fibonacci Numbers
… thesis is presented as an introduction to the Fibonacci sequence of integers. It is hoped that this thesis will create in the reader more interest in this type of sequence and especially the Fibonacci sequence. It seems that this particular area of mathematics is often ignored in the classroom …
-
The Fibonacci sequence and Hosoya's triangle
The purpose of this thesis is to study the Fibonacci sequence in a context many are unfamiliar with. A triangular array of numbers, similar looking to Pascal's triangle, was constructed a few decades ago and is called Hosoya's triangle. Each element within the triangle is created using Fibonacci …
-
The Fibonacci sequence and Hosoya's triangle
The purpose of this thesis is to study the Fibonacci sequence in a context many are unfamiliar with. A triangular array of numbers, similar looking to Pascal's triangle, was constructed a few decades ago and is called Hosoya's triangle. Each element within the triangle is created using Fibonacci …
-
Composições de Fibonacci e monoides livres
… estudaremos fórmulas expressando números de Fibonacci como somas sobre composições, onde a soma se estende sobre todas as composições a1; a2; ... ; ak de n1 para um k qualquer. Daremos uma explicação sistemática de tais fórmulas usando monoides livres. O número de composições de nem partes 1 …
-
Linear Forms in Logarithms and Fibonacci Numbers
… Omar Kihel, pertaining to Diophantine triples of Fibonacci numbers. To go along with this will be introductory material not included in said paper which establishes the mathematical concepts therein and offers some historical perspective and motivation. The initial aim of the paper was to explore …
-
Proving Properties of Fibonacci Representations via Automata Theory
… testing the completeness and unambiguity of Fibonacci-based representations via automata theory. We call a representation (or a number system) complete and unambiguous when it provides one and only one representation for each number in the range covered by the representation. Many commonly …
-
The Spectrum of the Off-diagonal Fibonacci Operator
The family of off-diagonal Fibonacci operators can be considered as Jacobi matrices acting in .e2(Z) with diagonal entries zero and off-diagonal entries given by sequences in the hull of the Fibonacci substitution sequence. The spectrum is independent of the sequence chosen and thus the same for …
Page 1 of 13