because the process

来源: idiot94 于 2004-06-18 13:19:29 [] [旧帖] [给我悄悄话] 阅读数 : 0 (433 bytes)

is fully reversible --- i.e., if 1 top vertex is reached, then there is one and only one path (following the same rules) to go back to the starting point. Therefore, no two monkeys will reach the same top (otherwise, they would have to start from the same bottom).
However, there are only finite number of ropes, therefore, after finite steps, every monkey must reach top nodes. Therefore, all 5 top nodes must be reached.
QED

请您先登陆，再发跟帖！