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 92
- Downloads 0
Detour Distant Divisor Graphs
Let G = (V,E) be a (p, q) - graph. The longest path P is called a detour distant divisor path if l(P) is a divisor of q . A detour distant divisor graph DD(G) of graph G = (V,E) has the vertex set V = V (G) and two verti...
On the exponential Diophantine equation
The exponential Diophantine equation in four variables given by is considered and analyzed for finding its non-zero integer solutions for different choices of m and n. A few numerical illustrations are present...
AN APPLICATION OF FUZZY SOFT RELATION IN DECISION MAKING PROBLEMS
Here we present the concept of soft relations and fuzzy soft relations and then applied in a decision making problem. In approximate reasoning, fuzzy soft relations have shown to be of a primordial importance. Huma...
On Relative Preclosedness of Strongly Compact (Countably p-Compact) Sets
In this paper, we study the preclosedness of strongly compact (countably p-compact) subsets of subspaces of strongly p-normal spaces. Consequences of the result for unions of specific sets are given. Examples are given t...
Securing Server System from Buffer Overflow vulnerability using Vel-Alagar Algorithm
Now a day’s buffer overflows have take place the most common target for network based attacks. The main proliferation method used by worms, malicious codes and improper coding by developers. Many techniques have be...