Negativity Subscripted Fibonacci And Lucas Numbers And Their Complex Factorizations
نویسندگان
چکیده
In this paper, we nd families of (0; 1; 1) tridiagonal matrices whose determinants and permanents equal to the negatively subscripted Fibonacci and Lucas numbers. Also we give complex factorizations of these numbers by the rst and second kinds of Chebyshev polynomials. 1. Introduction The well-known Fibonacci sequence, fFng ; is de ned by the recurrence relation, for n 2 Fn+1 = Fn + Fn 1 (1.1) where F1 = F2 = 1: The Lucas Sequence, fLng ; is de ned by the recurrence relation, for n 2 Ln+1 = Ln + Ln 1 (1.2) where L1 = 1; L2 = 3: Rules (1.1) and (1.2) can be used to extend the sequence backward, respectively, thus F 1 = F1 F0; F 2 = F0 F 1 L 1 = L1 L0; L 2 = L0 L 1; : : : ; and so on. Clearly F n = F n+2 F n+1 = ( 1) Fn; (1.3) L n = L n+2 L n+1 = ( 1) Ln: (1.4) In [9] and [5], the authors give complex factorizations of the Fibonacci numbers by considering the roots of Fibonacci polynomials as follows
منابع مشابه
On Factorization of the Fibonacci and Lucas Numbers Using Tridiagonal Determinants
The aim of this paper is to give new results about factorizations of the Fibonacci numbers Fn and the Lucas numbers Ln. These numbers are defined by the second order recurrence relation an+2 = an+1+an with the initial terms F0 = 0, F1 = 1 and L0 = 2, L1 = 1, respectively. Proofs of theorems are done with the help of connections between determinants of tridiagonal matrices and the Fibonacci and ...
متن کاملNew Fibonacci and Lucas primes
Extending previous searches for prime Fibonacci and Lucas numbers, all probable prime Fibonacci numbers Fn have been determined for 6000 < n ≤ 50000 and all probable prime Lucas numbers Ln have been determined for 1000 < n ≤ 50000. A rigorous proof of primality is given for F9311 and for numbers Ln with n = 1097, 1361, 4787, 4793, 5851, 7741, 10691, 14449, the prime L14449 having 3020 digits. P...
متن کاملMultilevel Fibonacci Conversion and Addition
Recently we have been making studies [1, 2] on the Fibonacci number system that appears to be of considerable importance to the Fibonacci computer [3], A specific result that appears to be of particular interest is that through multilevel coefficients on a Fibonacci radix system, efficient extension of representations can occur. For example, through a ternary coefficient system, a doubling of t...
متن کاملOn The Second Order Linear Recurrences By Generalized Doubly Stochastic Matrices
In this paper, we consider the relationships between the second order linear recurrences, and the generalized doubly stochastic permanents and determinants. 1. Introduction The Fibonacci sequence, fFng ; is de ned by the recurrence relation, for n 1 Fn+1 = Fn + Fn 1 (1.1) where F0 = 0; F1 = 1: The Lucas Sequence, fLng ; is de ned by the recurrence relation, for n 1 Ln+1 = Ln + Ln 1 (1.2) where ...
متن کاملOn the Fibonacci and Lucas p-numbers, their sums, families of bipartite graphs and permanents of certain matrices
In this paper we consider certain generalizations of the well-known Fibonacci and Lucas numbers, the generalized Fibonacci and Lucas p-numbers. We give relationships between the generalized Fibonacci p-numbers, Fp(n), and their sums, Pn i1⁄41F pðiÞ, and the 1-factors of a class of bipartite graphs. Further we determine certain matrices whose permanents generate the Lucas p-numbers and their sum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ars Comb.
دوره 96 شماره
صفحات -
تاریخ انتشار 2010