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 Just thinking... by pcbouhid)

Can't you get more from your analysis than you claim?  Wasn't the 6-cycle you obtained forced?  If so, the only possible cycles are divisors of 6, namely, 1, 2, 3, and 6, because only these cycles don't conflict with a 6-cycle.

Posted by McWorter on 2005-06-02 22:15:04