Results 271 to 280 of about 594,288 (306)
Some of the next articles are maybe not open access.
2021
In the literature, the Fibonacci numbers are usually denoted by \(F_n\), but this symbol is already reserved for the Fermat numbers in this book. So we will denote them by \(K_n\). The sequence of Fibonacci numbers \(\,\,(K_n)_{n=0}^\infty \,\,\) starts with \(K_0=0\) and \(K_1=1\) and satisfies the recurrence.
Michal Křížek +2 more
openaire +2 more sources
In the literature, the Fibonacci numbers are usually denoted by \(F_n\), but this symbol is already reserved for the Fermat numbers in this book. So we will denote them by \(K_n\). The sequence of Fibonacci numbers \(\,\,(K_n)_{n=0}^\infty \,\,\) starts with \(K_0=0\) and \(K_1=1\) and satisfies the recurrence.
Michal Křížek +2 more
openaire +2 more sources
Chaos, Solitons & Fractals, 2021
Abstract In this study, the Pell numbers are placed clockwise on the vertices of the polygons with a number corresponding to each vertex. Then, a relation among the numbers corresponding to a vertex is given. Furthermore, we obtain a formula which gives the mth term of the sequence formed at the kth vertex in an n-gon. The same procedure is repeated
Songül Çelik +2 more
openaire +2 more sources
Abstract In this study, the Pell numbers are placed clockwise on the vertices of the polygons with a number corresponding to each vertex. Then, a relation among the numbers corresponding to a vertex is given. Furthermore, we obtain a formula which gives the mth term of the sequence formed at the kth vertex in an n-gon. The same procedure is repeated
Songül Çelik +2 more
openaire +2 more sources
Optimization by k-Lucas numbers
Applied Mathematics and Computation, 2008This article presents a mathematical analysis of Fibonacci search method by k-Lucas numbers. In this study, we develop a new algorithm which determines the maximum point of unimodal functions on closed intervals. As a result, it makes Fibonacci search method more effective.
ÖMÜR, NEŞE +2 more
openaire +3 more sources
Incomplete Fibonacci and Lucas numbers
Rendiconti del Circolo Matematico di Palermo, 1996It is well known that the Fibonacci numbers \(F_n\) and the Lucas numbers \(L_n\) can be written as \[ \begin{aligned} F_n &= \sum^k_{i=0} {{n-1-i} \choose i}, \qquad \lfloor (n- 1)/2 \rfloor\leq k\leq n-1, \tag{1}\\ L_n &= \sum^k_{i=0} {n\over {n-i}} {{n-i} \choose i}, \qquad \lfloor n/2 \rfloor \leq k\leq n-1.
openaire +3 more sources
On Square Pseudo-Lucas Numbers
Canadian Mathematical Bulletin, 1978J. H. E. Cohn (1) has shown thatare the only square Fibonacci numbers in the set of Fibonacci numbers defined byIf n is a positive integer, we shall call the numbers defined by(1)pseudo-Lucas numbers.
openaire +2 more sources
1997
Consider the following number trick–try it out on your friends. You ask them to write down the numbers from 0 to 9. Against 0 and 1 they write any two numbers (we suggest two fairly small positive integers just to avoid tedious arithmetic, but all participants should write the same pair of numbers).
Peter Hilton +2 more
openaire +2 more sources
Consider the following number trick–try it out on your friends. You ask them to write down the numbers from 0 to 9. Against 0 and 1 they write any two numbers (we suggest two fairly small positive integers just to avoid tedious arithmetic, but all participants should write the same pair of numbers).
Peter Hilton +2 more
openaire +2 more sources
Power sums of Fibonacci and Lucas numbers
Quaestiones Mathematicae, 2011Polynomial representation formulae for power sums of the extended Fibonacci-Lucas numbers are established, which include, as special cases, four for-mulae for odd power sums of Melham type on Fibonacci and Lucas numbers, obtained recently by Ozeki and Prodinger (2009).Quaestiones Mathematicae 34(2011), 75 ...
CHU, Wenchang, LI N. N.
openaire +4 more sources
Perfect fibonacci and lucas numbers
Rendiconti del Circolo Matematico di Palermo, 2000Using elementary means, the author shows that no Fibonacci or Lucas number is perfect.
openaire +3 more sources
On the order-k generalized Lucas numbers
Applied Mathematics and Computation, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kilic, E, Tasci, D
openaire +2 more sources
1991
In the paper [3], we have proved that the only triangular numbers (i.e., the positive integers of the form \( \frac{1}{2}m \)(m+1)) in the Fibonacci sequence $$ {u_n} + 2 = {u_{n + 1}} + {u_{{n^,}}}{u_0} = 0, {u_1} = 1 $$ are u ±1=u2=1, u4=3, u8=21 and u10=55. This verifies a conjecture of Vern Hoggatt [2].
openaire +2 more sources
In the paper [3], we have proved that the only triangular numbers (i.e., the positive integers of the form \( \frac{1}{2}m \)(m+1)) in the Fibonacci sequence $$ {u_n} + 2 = {u_{n + 1}} + {u_{{n^,}}}{u_0} = 0, {u_1} = 1 $$ are u ±1=u2=1, u4=3, u8=21 and u10=55. This verifies a conjecture of Vern Hoggatt [2].
openaire +2 more sources