Maths Olympiad
Exam
Suppose the integers 1, 2, 3, . . . , 10 are split into two disjoint collections a1, a2, a3, a4, a5 and
b1, b2, b3, b4, b5 such that
a1 < a2 < a3 < a4 < a5,
b1 > b2 > b3 > b4 > b5.
(i) Show that the larger number in any pair {aj , bj}, 1 j 5, is at least 6.
(ii) Show that |a1-b1|+|a2-b2|+|a3-b3|+|a4-b4|+|a5-b5| = 25 for every such partition.
Read Solution (Total 0)
Maths Olympiad Other Question