A Fibonacci Series Problem @DrBarker
A Fibonacci Series Problem  @DrBarker
Uploaded September 2024 | Updated November 2026, 2 hours ago
We evaluate the sum from 1 to infinity of F_n^2/3^n, where F_n is the nth Fibonacci number.

Showing the original series is convergent:
Use Binet's formula to write F_n = (ϕ^n - ϕ^{-1})/sqrt{5}, then apply the comparison test with e.g. (ϕ^2 / 3)^n.

Shortcut way of dealing with T, the second sum:
proofwiki.org/wiki/Cassini%27s_Identity

00:00 Intro
00:32 Writing the sum in terms of itself
05:39 Dealing with the remaining sum
11:53 Convergence
A Fibonacci Series ProblemHow Do They Come Up With This Stuff?How Many Real Solutions Problem (Plus a Proof of Descartes Rule of Signs)Solving a Compound InequalityModulus Function Integration ProblemThere Are More Solutions Than You Might Think | The Pointwise Trap for Functional EquationsA Hyperbolic Take on the Fibonacci SequenceA Neat Application of Complex NumbersSimilar Triangles in the Complex PlaneLast Digits of Fifth PowersRemainder Theorem ProblemFind all Real Solutions
Dr Barker |

A Fibonacci Series Problem

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER