𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Binary Lucas and Fibonacci Polynomials, I

✍ Scribed by Günther Frei

Publisher
John Wiley and Sons
Year
1980
Tongue
English
Weight
994 KB
Volume
96
Category
Article
ISSN
0025-584X

No coin nor oath required. For personal study only.

✦ Synopsis

Binary Lucas and Fibonacci Polynomials, I

By GUNTHER FREI of Ste-Boy, Qu8bec (Canada) (Eingegungen urn 12.6.1979) (ii) Prei, Binary Lucas and Fibonacci Polynomials ( i i ) riiris similarly, that is If we set Definition 2.4. For any n 2 0, 85 then the polynoinials ill, and G,, are well defined for any integer n E 8, and we can show that proposition 2.3 now holds for any n 2.

Theorem 2.5. For uny n E 8, (i) * v n + 1 = DJfn + dMn-1, (ii) @,+I = DQ, + dG,-,. 1' roof. (a) The theorem is true for r~ 2 1 (proposition 2.3). D d (b) If n = 0, then

📜 SIMILAR VOLUMES

On color polynomials of Fibonacci graphs
On color polynomials of Fibonacci graphs
✍ Sherif El-Basil 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB

A recursion exists among the coefficients of the color polynomials of some of the families of graphs considered in recent work of Balasubramanian and Ramaraj.' Such families of graphs have been called Fibonacci graphs. Application to king patterns of lattices is given. The method described here appl

Fibonacci and Lucas numbers, and the gol
Fibonacci and Lucas numbers, and the golden section: S. Vajda, Ellis Horwood, Chichester, 1989. ISBN 0-7458-0715-1, 190 pages, £25
📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 79 KB

Broyden and Spedicato) form a large class of projection methods for solving systems of linear and nonlinear equations. This class contains most of the algorithms which are actually known thanks to the possibility of choosing some free parameters. This book presents the first unified treatment of the