نتایج جستجو برای: fibonacci sequence

تعداد نتایج: 408412  

2006
Manolis Christodoulakis Costas S. Iliopoulos Yoan J. Pinzón

In this paper we focus on the combinatorial properties of the Fibonacci strings rotations. We first present a simple formula that, in constant time, determines the rank of any rotation (of a given Fibonacci string) in the lexicographically-sorted list of all rotations. We then use this information to deduce, also in constant time, the character that is stored at any one location of any given Fi...

2014
Krishna Kumar Sharma Vikas Panwar Sumit Kumar Sharma

Among numerical sequences, the Fibonacci numbers have achieved a kind of celebrity status with such fabulous properties, it is no wonder that the Fibonacci numbers stand out as a kind of super sequence. Fibonacci numbers have been studied in many different forms for centuries and the literature on the subject is consequently, incredibly vast. The Fibonacci sequence has been generalized in a num...

2012
Marcia Edson Omer Yayenie

Consider the Fibonacci sequence {Fn}n=0 having initial conditions F0 = 0, F1 = 1 and recurrence relation Fn = Fn−1 + Fn−2 (n ≥ 2). The Fibonacci sequence has been generalized in many ways, some by preserving the initial conditions, and others by preserving the recurrence relation. In this article, we study a new generalization {qn}, with initial conditions q0 = 0 and q1 = 1 which is generated b...

Journal: :Proyecciones (Antofagasta) 2020

2012
Sam Vandervelde

Brother Alfred has characterized primes dividing every Fibonacci sequence [2] based on their period and congruence class mod 20. More recently, in [4] Ballot and Elia have described the set of primes dividing the Lucas sequence, meaning they divide some term of the sequence. Our purpose here is to extend the results of the former paper utilizing the methods of the latter. In particular we will ...

2003
C. M. Campbell P. P. Campbell H. Doostie E. F. Robertson

For a finitely generated group G = 〈A〉 where A = {a1, a2, . . . , an} the sequence xi = ai+1, 0 ≤ i ≤ n − 1, xi+n = ∏n j=1 xi+j−1, i ≥ 0, is called the Fibonacci orbit of G with respect to the generating set A, denoted FA(G). If FA(G) is periodic we call the length of the period of the sequence the Fibonacci length of G with respect to A, written LENA(G). In this paper we examine the Fibonacci ...

Journal: :Indian Scientific Journal Of Research In Engineering And Management 2023

The Fibonacci sequence is one of the most beautiful and febulas mathematical concepts. Number turn in place that you have probably seen nature. a series numbers follows unique integers sequence. These generate patterns can be found all real life. are also called golden ratio. section used for architect, art, Space exploration, etc. Keywords: Numbers, Golden ratio

2009
Marcia Edson Omer Yayenie

Consider the Fibonacci sequence {Fn}n=0 with initial conditions F0 = 0, F1 = 1 and recurrence relation Fn = Fn−1 + Fn−2 (n ≥ 2). The Fibonacci sequence has been generalized in many ways, some by preserving the initial conditions, and others by preserving the recurrence relation. In this article, we study a new generalization {qn}, with initial conditions q0 = 0 and q1 = 1, which is generated by...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید