Original problem: here
First, I apologize that the problem was not carefully worded. The problem statement should have been: find all initial conditions where it's always possible for Bob to empty all the three boxes.
There are 3 boxes, and 2010 stones and 2010 marbles are put arbitrarily inside those three boxes.
At each step, Bob is allowed to either:
1. take a stone from one box, a marble from another box, and put them on the third box
2. add or subtract all boxes by the same number of stones
3. add or subtract all boxes by the same number of marbles
Prove or disprove, that by repeating these steps, Bob can empty all three boxes.
Showing posts with label operation. Show all posts
Showing posts with label operation. Show all posts
Thursday, December 17, 2009
Solution: Stones and Marbles
Labels:
change,
Combinatorics,
invariance,
modulo,
operation,
Solution,
span
Subscribe to:
Posts (Atom)