The Binet Forms for the Fibonacci and Lucas Numbers
Journal Title: INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY - Year 2014, Vol 10, Issue 1
Abstract
The Binet forms for the well known Fibonacci and Lucas Sequences {Fn} and {Ln}are discussed, in detail, in this paper.
Authors and Affiliations
Datta M. Mahajan
Keywords
Related Articles
- EP ID EP131856
- DOI -
- Views 93
- Downloads 0
On the Dynamical Analysis of a New Model for Measles Infection
Epidemiologists and other health workers all over the world have noted that vaccination is an effective means of preventing most childhood diseases. In this study a compartmental mathematical model was formulated with th...
On Predicting the Next Term of a Sequence
When introducing sequences to students, the first skill we teach them is how to predict the next term of a sequence given the first few terms, usually the first three, four or five terms. In this note, we intend to show...
Total Outer Equitable Connected Domination of a Graph
Let G = (V, E) be a graph. A set D V (G) is equitable dominating set of G if v V – D a vertex u D such that uv E (G) and |d(u) – d(v)| 1. A set D V (G) is outer equitable dominating set if D is equitable dominati...
Projective Synchronization by SMC for a class of Uncertain Chaotic System with Time Varying Delays
This paper is further to investigate the projective synchronization of a class of uncertain chaotic system with time varying delays. Based on the Lyapunov stability theorem, by using the LMI technique and designing...
The Upper Connected Monophonic Number and Forcing Connected Monophonic Number of a Graph
— A connected monophonic set ࡹ in a connected graph ࡳ = (ࢂ,ࡱ) is called a minimal connected monophonic set if no proper subset of M is a connected monophonic set of ࡳ. The upper connected monophonic number mc ...