- #1
SNOOTCHIEBOOCHEE
- 145
- 0
Homework Statement
Show (without proof) : For every k, there exists a arbitrarily large n that are not the sum of k fibbonacci numbers.
The Attempt at a Solution
Really i am pretty lost here.I tried to do a proof by induction, but this didnt work.
Then i realized i am not supposed to do a proof, and have no clue how to show this is true otherwise.
Any thoughts?
Last edited: