Skip to content
Research Article Open access CC BY 4.0

A Phenomenon in Fibonacci Numbers and Its Generalization

Cherng-Tiao Perng, Boyd Coan

Journal of Advances in Mathematics and Computer Science · pp. 86–93 · Published 21 May 2015

10.9734/BJMCS/2015/18126

Abstract

Motivated by the result of Fibonacci numbers for which the ratio of successive terms tends to a limit, which is commonly known as the Golden Ratio, we prove an immediate generalization for a wider class of recurrence sequences. We note that such limiting behavior for ratio of successive terms of general linear recurrence sequences has been well discussed, but still they need to satisfy specic conditions for the limit to exist. Our contribution is that we show that such conditions are indeed satised for the cases we are considering. For an application of our main result, we find a natural way to approximate an algebraic number, which is a zero for some class of polynomial equations, by rational numbers. As recently there seem to be renewed interests on Fibonacci numbers and related recurrence sequences, we hope that our elementary methods and results may shed some light for solving the related problems.

Fibonacci numbers recurrence sequences generating functions.

Cited by 0

No indexed citations yet.

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

0

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.