1998 IMO Shortlist Problems/C3
Revision as of 00:13, 15 May 2021 by Sumitrajput0271 (talk | contribs) (Created page with "The numbers from 1 to 9 are written in an arbitrary order. A move is to reverse the order of any block of consecutive increasing or decreasing numbers. For example, a move cha...")
The numbers from 1 to 9 are written in an arbitrary order. A move is to reverse the order of any block of consecutive increasing or decreasing numbers. For example, a move changes 916532748 to 913562748. Show that at most 12 moves are needed to arrange the numbers in increasing order.
