Olympiad Maths Prep

Library / /6 of 22

Number theory Difficulty 5.0 AIME Prove it Ukraine

Let a,b,c,da, b, c, d be distinct natural numbers such that ab+cdab + cd is divisible by ac+bdac + bd. Prove that ac+bdac + bd is a composite number.

Solution

To the contrary, assume that ac+bdac + bd is prime. Then ac+bdab+cdac+bdac+bd+ab+cd=(a+d)(b+c)ac + bd \mid ab + cd \Rightarrow ac + bd \mid ac + bd + ab + cd = (a + d)(b + c), and so ac+bda+dac + bd \mid a + d or ac+bdb+cac + bd \mid b + c. But this is impossible because for distinct a,b,c,da, b, c, d we have that ac+bd>a+dac + bd > a + d and ac+bd>b+cac + bd > b + c. 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.