Skip to main content

Fibonacci imposters

Buy Article:

$55.00 plus tax (Refund Policy)

With Simson's 1753 paper as a starting point, the current paper reports investigations of Simson's identity (also known as Cassini's) for the Fibonacci sequence as a means to explore some fundamental ideas about recursion. Simple algebraic operations allow one to reduce the standard linear Fibonacci recursion to the nonlinear Simon's recursion that is equivalent to Simson's identity and then further to a nonlinear recursion dependent only on a single preceding term. This leads to a striking nonrecursive characterization of Fibonacci numbers that is much less well-known than it should be. It is then discovered that Simson's recursion itself implies a family of linear recursions and characterizes a class of generalized Fibonacci sequences.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
No Metrics

Document Type: Research Article

Publication date: 2007-01-01

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
X
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more