A fast recurrence for Fibonacci and Lucas numbers
Abstract
We derive the double recurrence en = 12(an-1+5bn-1); fn = 12(an-1+bn-1) with e0=2;f0=0 for the Fibonacci numbers, leading to an extremely simple and fast implementation. Though the recurrence is probably not new, we have not been able to find a reference for it.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.