Maths Olympiad Prep

Library / /580 of 740

, 2023

Number theory Difficulty 5.3 AIME, harder Prove it United States

Problem:

The pairwise greatest common divisors of five positive integers are

2,3,4,5,6,7,8,p,q,r 2, 3, 4, 5, 6, 7, 8, p, q, r

in some order, for some positive integers p,q,rp, q, r. Compute the minimum possible value of p+q+rp+q+r.

Solution

Solution:

To see that 99 can be achieved, take the set {6,12,40,56,105}\{6, 12, 40, 56, 105\}, which gives

{p,q,r}={2,3,4} \{p, q, r\} = \{2, 3, 4\}

Now we show it's impossible to get lower.

Notice that if mm of the five numbers are even, then exactly (m2)\binom{m}{2} of the gcd's will be even. Since we're shown four even gcd's and three odd gcd's, the only possibility is m=4m=4. Hence exactly two of p,q,rp, q, r are even.

Similarly, if nn of the five numbers are divisible by 33, then exactly (n2)\binom{n}{2} of the gcd's will be divisible by 33. Since we're shown two gcd's that are multiples of 33 and five gcd's that aren't, the only possibility is n=3n=3. Hence exactly one of p,q,rp, q, r is divisible by 33.

Similarly, if kk of the five numbers are divisible by 44, then exactly (k2)\binom{k}{2} of the gcd's will be divisible by 44. Since we're shown two gcd's that are multiples of 44 and five gcd's that aren't, the only possibility is k=3k=3. Hence exactly one of p,q,rp, q, r is divisible by 44.

So two of p,q,rp, q, r are even, one of them is divisible by 44, and one of them is divisible by 33. It's easy to see by inspection there are no possibilities where p+q+r<9p+q+r < 9.

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.