Prove that fn + fn−1 + fn−2 + 2n−3 + 4fn−4 + 8fn−5 + ⋯ + 2n−3 = 2n−1 whenever n is an integer with n ≥ 3.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.