- 1 (18.64 KiB) Viewed 24 times
Let fn be the nth Fibonacci number. Recall that fn = fn-1 + fn-2; fo = 0, f₁ = 1. Prove that for all n ≥ 1, n Σf} = fnfn
-
answerhappygod
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
Let fn be the nth Fibonacci number. Recall that fn = fn-1 + fn-2; fo = 0, f₁ = 1. Prove that for all n ≥ 1, n Σf} = fnfn
Let fn be the nth Fibonacci number. Recall that fn = fn-1 + fn-2; fo = 0, f₁ = 1. Prove that for all n ≥ 1, n Σf} = fnfn+1 i=1 For all positive integers n, show that 4 + 8 + 12 + ... + 4n = 2n² + 2n.