BMO Round 1, 2012

Combinatorics Difficulty 6.0 National Olympiad Find the answer United Kingdom

Consider the numbers $1, 2, \ldots, n$ . Find, in terms of $n$ , the largest integer $t$ such that these numbers can be arranged in a row so that all consecutive terms differ by at least $t$ .

We don't reproduce this publisher's solutions. Their own solution is here — work the problem first.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: UK Mathematics Trust, licensed © UK Mathematics Trust; question papers published free at bmos.ukmt.org.uk. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.