1. The problem statement, all variables and given/known data Show (without proof) : For every k, there exists a arbitrarily large n that are not the sum of k fibbonacci numbers. 3. 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?