Over 2000 numbers are around a circle. Each number is the sum of its left and right neighbors.

Given that one of the numbers is a one, how many numbers (as a minimum) must there be?

(In reply to re: Just thinking... by McWorter)

McWorter, I'm posting this comment AFTER you posted the solution.

It's not a justification (now), but what I tried to do was exactily what you done. I tested the possibilities that you tested. And this leads me to that contradictions that you pointed out.

The only thing that I didn't figure out was that this was a whole proof. I thought that maybe something else I was missing.

Posted by pcbouhid on 2005-06-04 22:08:04