AbstractA Fibonacci integer is an integer in the multiplicative group generated by the Fibonacci numbers. For example, 77=21⋅55/(3⋅5) is a Fibonacci integer. Using some results about the structure of this multiplicative group, we determine a near-asymptotic formula for the counting function of the Fibonacci integers, showing that up to x the number of them is between exp(c(logx)1/2−(logx)ϵ) and exp(c(logx)1/2+(logx)1/6+ϵ), for an explicitly determined constant c. The proof is based on both combinatorial and analytic arguments
Two algorithms for finding Fibonacci numbers are presented. They are analyzed both from the worst ca...
Abstract. The present paper introduces an hierarchy (Figure 1) of extensions of Fibonacci numbers (F...
This paper presents an attempt to explain and experiment with Fibonacci numbers. It is illustrated w...
This research paper deals with the study of the Fibonacci Numbers and Continued Fractions. The Fibon...
In this diploma thesis, the combinatorial proofs of Fibonacci and related identities are discussed. ...
For every integer n ≥ 2 we define the Fibonacci class of degree 2 of 2-generated groups, and study c...
In this paper we define the associated k−Fibonacci numbers and we give a combinatorial interpretatio...
AbstractWe exhibit and study various regularity properties of the sequence (R(n))n⩾1 which counts th...
Fibonacci trees are special binary trees which are of natural interest in the study of data structur...
Let 1, 2, 3, 5, 8, … denote the Fibonacci sequence beginning with 1 and 2, and then setting each sub...
These notes put on record part of the contents of a conversation the first author had with John Conw...
Wydział Matematyki i InformatykiW rozprawie zostały przedstawione rezultaty dotyczące ciągów typu Fi...
Copyright c © 2015 Ali H. Hakami. This is an open access article distributed under the Creative Comm...
AbstractA summation formula related to the Fibonacci expansion of integers is given
The Fibonacci sequence (1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89 144 233 277, ...) is perhaps the most f...
Two algorithms for finding Fibonacci numbers are presented. They are analyzed both from the worst ca...
Abstract. The present paper introduces an hierarchy (Figure 1) of extensions of Fibonacci numbers (F...
This paper presents an attempt to explain and experiment with Fibonacci numbers. It is illustrated w...
This research paper deals with the study of the Fibonacci Numbers and Continued Fractions. The Fibon...
In this diploma thesis, the combinatorial proofs of Fibonacci and related identities are discussed. ...
For every integer n ≥ 2 we define the Fibonacci class of degree 2 of 2-generated groups, and study c...
In this paper we define the associated k−Fibonacci numbers and we give a combinatorial interpretatio...
AbstractWe exhibit and study various regularity properties of the sequence (R(n))n⩾1 which counts th...
Fibonacci trees are special binary trees which are of natural interest in the study of data structur...
Let 1, 2, 3, 5, 8, … denote the Fibonacci sequence beginning with 1 and 2, and then setting each sub...
These notes put on record part of the contents of a conversation the first author had with John Conw...
Wydział Matematyki i InformatykiW rozprawie zostały przedstawione rezultaty dotyczące ciągów typu Fi...
Copyright c © 2015 Ali H. Hakami. This is an open access article distributed under the Creative Comm...
AbstractA summation formula related to the Fibonacci expansion of integers is given
The Fibonacci sequence (1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89 144 233 277, ...) is perhaps the most f...
Two algorithms for finding Fibonacci numbers are presented. They are analyzed both from the worst ca...
Abstract. The present paper introduces an hierarchy (Figure 1) of extensions of Fibonacci numbers (F...
This paper presents an attempt to explain and experiment with Fibonacci numbers. It is illustrated w...