MathLabs

Problem 5

Two squirrels, Bushy and Jumpy, have collected 20212021 walnuts for the winter. Jumpy numbers the walnuts from 11 through 20212021 and digs 20212021 little holes in a circular pattern in the ground around their favourite tree. The next morning Jumpy notices that Bushy had placed one walnut into each hole, but had paid no attention to the numbering. Unhappy, Jumpy decides to reorder the walnuts by performing a sequence of 20212021 moves. In the kk-th move, Jumpy swaps the positions of the two walnuts adjacent to walnut kk. Prove that there exists a value of kk such that, on the kk-th move, Jumpy swaps some walnuts aa and bb with a<k<ba<k<b.
Step 5 of 5: Reach a contradiction after all 20212021 moves
∃ frozen black block of length 2 forever\exists\ \text{frozen black block of length } 2\ \text{forever}
Detailed analysis

Starting from the even block of length 20202020, each split produces one even and one odd sub-block, and every even sub-block eventually reduces (through further splits) to a frozen block of length exactly 22 that can never turn fully red. So at least one pair of black walnuts survives forever. But move kk colours walnut kk red for every k=1,…,2021k=1,\ldots,2021, so after all 20212021 moves every walnut is red — a contradiction. Hence the assumption fails, and some move kk must swap walnuts a<k<ba<k<b.