From golden-ratio equalities to Fibonacci and Lucas identities

2013 ◽  
Vol 97 (539) ◽  
pp. 234-241
Author(s):  
Martin Griffiths

We demonstrate here a remarkably simple method for deriving a large number of identities involving the Fibonacci numbers, Lucas numbers and binomial coefficients. As will be shown, this is based on the utilisation of some straightforward properties of the golden ratio in conjunction with a result concerning irrational numbers. Indeed, for the simpler cases at least, the derivations could be understood by able high-school students. In particular, we avoid the use of exponential generating functions, matrix methods, Binet's formula, involved combinatorial arguments or lengthy algebraic manipulations.

2021 ◽  
Vol 48 (4) ◽  
Author(s):  
Nabiha Saba ◽  
◽  
Ali Boussayoud ◽  
Abdelhamid Abderrezzak ◽  
◽  
...  

In this paper, we will firstly define a new generalization of numbers (p, q) and then derive the appropriate Binet's formula and generating functions concerning (p,q)-Fibonacci numbers, (p,q)- Lucas numbers, (p,q)-Pell numbers, (p,q)-Pell Lucas numbers, (p,q)-Jacobsthal numbers and (p,q)-Jacobsthal Lucas numbers. Also, some useful generating functions are provided for the products of (p,q)-numbers with bivariate complex Fibonacci and Lucas polynomials.


Author(s):  
Yilmaz Simsek

The aim of this paper is to define new families of combinatorial numbers and polynomials associated with Peters polynomials. These families are also a modification of the special numbers and polynomials in [11]. Some fundamental properties of these polynomials and numbers are given. Moreover, a combinatorial identity, which calculates the Fibonacci numbers with the aid of binomial coefficients and which was proved by Lucas in 1876, is proved by different method with the help of these combinatorial numbers. Consequently, by using the same method, we give a new recurrence formula for the Fibonacci numbers and Lucas numbers. Finally, relations between these combinatorial numbers and polynomials with their generating functions and other well-known special polynomials and numbers are given.


Symmetry ◽  
2021 ◽  
Vol 13 (8) ◽  
pp. 1334
Author(s):  
Rifat Battaloglu ◽  
Yilmaz Simsek

The main purpose of this paper is to give many new formulas involving the Fibonacci numbers, the golden ratio, the Lucas numbers, and other special numbers. By using generating functions for the special numbers with their functional equations method, we also give many new relations among the Fibonacci numbers, the Lucas numbers, the golden ratio, the Stirling numbers, and other special numbers. Moreover, some applications of the Fibonacci numbers and the golden ratio in chemistry are given.


2020 ◽  
Vol 1 (3) ◽  
pp. 112-122
Author(s):  
Agung Prabowo

Fibonacci numbers, Lucas numbers and Mulatu numbers are built in the same method. The three numbers differ in the first term, while the second term is entirely the same. The next terms are the sum of two successive terms. In this article, generalizations of Fibonacci, Lucas and Mulatu (GFLM) numbers are built which are generalizations of the three types of numbers. The Binet formula is then built for the GFLM numbers, and determines the golden ratio, silver ratio and Bronze ratio of the GFLM numbers. This article also presents generalizations of these three types of ratios, called Metallic ratios. In the last part we state the Metallic ratio in the form of continued fraction and nested radicals.


Author(s):  
Yüksel Soykan

In this paper, we introduce the generalized dual hyperbolic Fibonacci numbers. As special cases, we deal with dual hyperbolic Fibonacci and dual hyperbolic Lucas numbers. We present Binet's formulas, generating functions and the summation formulas for these numbers. Moreover, we give Catalan's, Cassini's, d'Ocagne's, Gelin-Cesàro's, Melham's identities and present matrices related with these sequences.


2010 ◽  
Vol 60 (6) ◽  
Author(s):  
Pavel Pražák ◽  
Pavel Trojovský

AbstractNew results about some sums s n(k, l) of products of the Lucas numbers, which are of similar type as the sums in [SEIBERT, J.—TROJOVSK Ý, P.: On multiple sums of products of Lucas numbers, J. Integer Seq. 10 (2007), Article 07.4.5], and sums σ(k) = $$ \sum\limits_{l = 0}^{\tfrac{{k - 1}} {2}} {(_l^k )F_k - 2l^S n(k,l)} $$ are derived. These sums are related to the numerator of generating function for the kth powers of the Fibonacci numbers. s n(k, l) and σ(k) are expressed as the sum of the binomial and the Fibonomial coefficients. Proofs of these formulas are based on a special inverse formulas.


Filomat ◽  
2020 ◽  
Vol 34 (8) ◽  
pp. 2655-2665
Author(s):  
Gospava Djordjevic ◽  
Snezana Djordjevic

In this paper we consider the generalized Fibonacci numbers Fn,m and the generalized Lucas numbers Ln,m. Also, we introduce new sequences of numbers An,m, Bn,m, Cn,m and Dn,m. Further, we find the generating functions and some recurrence relations for these sequences of numbers.


2021 ◽  
Vol 21 (1) ◽  
pp. 125-144
Author(s):  
NABIHA SABA ◽  
ALI BOUSSAYOUD ◽  
MOHAMED KERADA

In this study, we introduce a new class of generating functions of odd and even Gaussian (p,q)-Fibonacci numbers, Gaussian (p,q)-Lucas numbers, Gaussian (p,q)-Pell numbers, Gaussian (p,q)-Pell Lucas numbers, Gaussian Jacobsthal numbers and Gaussian Jacobsthal Lucas numbers and we will recover the new generating functions of some Gaussian polynomials at odd and even terms. The technique used her is based on the theory of the so called symmetric functions.


2021 ◽  
Vol 55 (2) ◽  
pp. 115-123
Author(s):  
R. Frontczak ◽  
T. Goy

The purpose of this paper is to present closed forms for various types of infinite seriesinvolving Fibonacci (Lucas) numbers and the Riemann zeta function at integer arguments.To prove our results, we will apply some conventional arguments and combine the Binet formulasfor these sequences with generating functions involving the Riemann zeta function and some known series evaluations.Among the results derived in this paper, we will establish that $\displaystyle\sum_{k=1}^\infty (\zeta(2k+1)-1) F_{2k} = \frac{1}{2},\quad\sum_{k=1}^\infty (\zeta(2k+1)-1) \frac{L_{2k+1}}{2k+1} = 1-\gamma,$ where $\gamma$ is the familiar Euler-Mascheroni constant.


2001 ◽  
Vol 24 (3) ◽  
pp. 167-167
Author(s):  
B. Suzuki

We organized the Leonids observing network that comprised of 276 observation teams consisting of about 3,000 senior high-school students in Japan on Nov. 17 1998. We counted the visible meteors with our naked eyes. It was a simple method, but the many data enabled us to discuss the structure of the dust trail. However, the base-line is so short that we could not discuss the structure in full detail. In 1999, we organized a worldwide network of senior high-school students. The network is comprised of 307 teams from 23 countries. The base-line of our new project is the size of the Earth. We succeeded in making 20 hours continuous observations with this network. One of the observational teams in Tanzania encountered the Leonid meteor storm. We report on the scientific results and the educational aspects of these projects. (Web site: www.leonids.net/) (Leonids ‘98-’99 staff – co-authors – are A. Miyashita, M. Okyudo, H. Agata, T. Mizuno, T. Hamane K. Watanabe of Japan, C. Pennypaker, A. Gould, K. McCarron, G. Reagan and K. Meredith, of the U.S.A.)


Sign in / Sign up

Export Citation Format

Share Document