(a) Show that the Maclaurin series of the function
wherefn is the nth Fibonacci number, that is, f1 = 1, f2 = 1, and fn = fn−1 + fn−2 for n ≥ 3. [Hint: Write x/(1 – x − x2) = c0 + c1x + c2x2 + ⋯ and multiply both sides of this equation by 1 – x − x2.]
(b) By writing f(x) as a sum of partial fractions and thereby obtaining the Maclaurin series in a different way. find an explicit formula for the nth Fibonacci number.
Want to see the full answer?
Check out a sample textbook solutionChapter 11 Solutions
Calculus, Early Transcendentals
- Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage