Let , , , , and be integers satisfying , and . Find an integer so that and divides .
, 2012
Solution
The answer is .
We claim that divides .
Firstly, observe that divides or divides , since otherwise
which is impossible. Similarly, divides or , and divides or . Thus, two of , , are divisible by , say and . Then we have divides , and the first equation becomes . Again, divides one of and . Thus, we have divides . In general, we must have divides .
Secondly, observe that divides or divides , since otherwise
which is impossible. As above, this implies divides .
Thirdly, observe that divides , or , since otherwise
In the same way, divides one of , , , divides one of , , . It is not hard to see divides at least two of , , , , , , and hence divides .
Combining these, we obtain divides .
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.