MathCastle
Proof WritingChallengeProblem-Solving Strategies

Problem-Solving Strategies · Challenge problem

Seven chips sit on square 00 of an infinite line of squares. A move takes two chips from one square and sends one to each neighbouring square. When no square holds two chips, the process stops. How many moves does it take?