Olympiad Maths Prep

Library / /10 of 15

, 2010

Algebra Difficulty 5.6 AIME, harder Prove it Ukraine

Vitalii, Michael and Olexandr were given nn dollars by their mother each one. Vitalii had to spend all his money for buying books, Michael for buying notebooks, Olexandr for pens. Vitalii had bought 1 book, Michael 2 notebooks and Olexandr 5 pens. After that, they together had nn dollars. Prove that one of the boys can buy one more item.

Solution

Assuming the contrary. Denote by q1,q2q_1, q_2 and q3q_3 the costs of one book, notebook and pen, respectively, and by r1,r2,r3r_1, r_2, r_3 the change our boys were given. Obviously r1<q1,r2<q2,r3<q3r_1 < q_1, r_2 < q_2, r_3 < q_3. From the statement we have
n=q1+r1,n=2q2+r2,n=5q3+r3 n = q_1 + r_1, \quad n = 2q_2 + r_2, \quad n = 5q_3 + r_3
and we can write the next inequalities: n=q1+r1>2r1n = q_1 + r_1 > 2r_1, n=2q2+r2>3r2n = 2q_2 + r_2 > 3r_2, n=5q3+r3>6r3r1<12n,r2<13n,r3<16nn = 5q_3 + r_3 > 6r_3 \Rightarrow r_1 < \frac{1}{2}n, r_2 < \frac{1}{3}n, r_3 < \frac{1}{6}n. Adding them we will have
n=r1+r2+r3<n2+n3+n6=n n = r_1 + r_2 + r_3 < \frac{n}{2} + \frac{n}{3} + \frac{n}{6} = n
which is impossible. This contradiction completes the proof.

Looking for a route rather than an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.