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 1 of 5: Assume no move ever straddles its own number
∀k: (a<b<k) or (k<a<b)\forall k:\ (a<b<k)\ \text{or}\ (k<a<b)
Detailed analysis

Suppose for contradiction that for every kk, the two walnuts a,ba,b swapped on move kk satisfy a<b<ka<b<k or k<a<bk<a<b, i.e. never a<k<ba<k<b.