Let a,b,c,d be distinct natural numbers such that ab+cd is divisible by ac+bd. Prove that ac+bd is a composite number.
Solution
To the contrary, assume that ac+bd is prime. Then ac+bd∣ab+cd⇒ac+bd∣ac+bd+ab+cd=(a+d)(b+c), and so ac+bd∣a+d or ac+bd∣b+c. But this is impossible because for distinct a,b,c,d we have that ac+bd>a+d and ac+bd>b+c. This contradiction completes the proof.
Want a route through all this instead of 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 reproduced verbatim; metadata (topic, difficulty) added by this project.