TITLE

Ratio by Using Coefficients of Fibonacci Sequence

AUTHOR(S)
Garg, Megha; Garg, Pertik; Kumar, Ravinder
PUB. DATE
September 2013
SOURCE
International Journal of Mathematical Combinatorics;Sep2013, Vol. 3, p96
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
In this paper, ratio by using coefficients of Fibonacci sequence has been discussed in detail. The Fibonacci series is made from Fn+2 = Fn + Fn+1. New sequences from the formula Fn+2 = aFn + bFn+1 by using a and b, where a and b are consecutive coefficients of Fibonacci sequence are formed. These all new sequences have their own ratios. When find the ratio of these ratios, it always becomes 1.6, which is known as golden ratio in Fibonacci series.
ACCESSION #
91942097

 

Related Articles

  • Fibonacci Numbers from a Long Division Formula. Amini, Abbas Roohol // Mathematical Spectrum;2007/2008, Vol. 40 Issue 2, p59 

    The article focuses on finding the Fibonacci numbers from a long division formula. It states that the Fibonacci sequence has properties too numerous to list, and each property has almost as many ways of proving it. It presents the golden ratio. According to the article, the coefficients, which...

  • SOME OLD AND NEW RESULTS FOR THE WORLD'S MOST FAMOUS SEQUENCE OF NUMBERS. Dence, Thomas // Journal of Applied Global Research;Spring2013, Vol. 6 Issue 16, p38 

    The Fibonacci numbers are quite possibly the world's most famous sequence of numbers. Their occurrences in nature, the social sciences, architecture, the fine arts, and the physical sciences are much too numerous to list. Presented here are interesting, and varied, selections of these...

  • Some Identities of Generalized Fibonacci Sequence. Chong, Chin-Yoon; Cheah, C. L.; Ho, C. K. // AIP Conference Proceedings;2014, Vol. 1605, p661 

    We introduced the generalized Fibonacci sequence {Un} defined by U0 = 0, U1 = 1, and Un+2 - pUn+1 + qUn for all p, q ∈ ℤ+ and for all non-negative integers n. In this paper, we obtained some recursive formulas of the sequence.

  • Golden Section and the Biological Time of Human Beings.  // TTEM- Technics Technologies Education Management;2011, Vol. 6 Issue 1, p218 

    No abstract available.

  • A Novel Multi Exponentiation Method. Goundar, Raveen R. // International Journal of Applied Mathematics;2007, Vol. 37 Issue 2, p89 

    The efficiency and security of most elliptic curve cryptosystems are based on multi exponentiation, such as the verification process in elliptic curve digital signature algorithm. Simultaneous methods are considered to be the most efficient for multi exponentiation. In this paper, we propose a...

  • Exploring the Fibonacci Sequence of Order Three. SCHIFFMAN, JAY L. // Mathematical Spectrum;2013/2014, Vol. 46 Issue 2, p66 

    The Fibonacci sequence of order three is the sequence of numbers 1,3, 10, 33, 109 ..... Each term in this sequence from the third term on is equal to three times the previous term plus the term two places before it. This article will explore ideas such as divisibility and periodicity as well as...

  • Can Fibonacci numbers improve your search algorithms? Schweber, Bill // EDN;10/12/2000, Vol. 45 Issue 21, p65 

    Studies the use of Fibonacci numbers and the golden section or ratio in search algorithms. Overview of the concepts; Approaches in finding the maximum or minimum of a mathematical function between two boundaries; Applications. INSET: Searching for the top (or bottom)..

  • Cube Polynomial of Fibonacci and Lucas Cubes. Klavžar, Sandi; Mollard, Michel // Acta Applicandae Mathematica;Feb2012, Vol. 117 Issue 1, p93 

    The cube polynomial of a graph is the counting polynomial for the number of induced k-dimensional hypercubes ( k≥0). We determine the cube polynomial of Fibonacci cubes and Lucas cubes, as well as the generating functions for the sequences of these cubes. Several explicit formulas for the...

  • A Matrix Approach for General Higher Order Linear Recurrences. KILICÇ, EMRAH; STĂNICĂ, PANTELIMON // Bulletin of the Malaysian Mathematical Sciences Society;2011, Vol. 34 Issue 1, p51 

    We consider k sequences of generalized order-k linear recurrences with arbitrary initial conditions and coefficients, and we give their generalized Binet formulas and generating functions. We also obtain a new matrix method to derive explicit formulas for the sums of terms of the k sequences....

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics