Difference between revisions of "2010 IMO Problems/Problem 5"
(Created page with '== Problem == Each of the six boxes <math>B_1</math>, <math>B_2</math>, <math>B_3</math>, <math>B_4</math>, <math>B_5</math>, <math>B_6</math> initially contains one coin. The f…') |
(No difference)
|
Revision as of 11:13, 20 July 2010
Problem
Each of the six boxes , , , , , initially contains one coin. The following operations are allowed
Type 1) Choose a non-empty box , , remove one coin from and add two coins to ;
Type 2) Choose a non-empty box , , remove one coin from and swap the contents (maybe empty) of the boxes and .
Determine if there exists a finite sequence of operations of the allowed types, such that the five boxes , , , , become empty, while box contains exactly coins.
Author: Unknown currently