Maths Olympiad Prep

Library / /376 of 520

Number theory Difficulty 5.9 AIME, harder Find the answer

12. Let SS be a non-empty subset of the set {1,2,,108}\{1,2, \cdots, 108\}, satisfying: (i) for any numbers a,ba, b in SS, there exists a number cc in SS such that (a,c)=(b,c)=1(a, c)=(b, c)=1; (ii) for any numbers a,ba, b in SS, there exists a number cc^{\prime} in SS such that (a,c)>1,(b,c)=1\left(a, c^{\prime}\right)>1,\left(b, c^{\prime}\right)=1. Find the maximum possible number of elements in SS.

A number or a short expression. Spacing and $ signs are ignored.

Solution

12. Answer 76.

Let S3,p1α1p2α2p3a3S,p1,p2,p3|S| \geqslant 3, p_{1}^{\alpha_{1}} p_{2}^{\alpha_{2}} p_{3}^{a_{3}} \in S, p_{1}, p_{2}, p_{3} be three different primes, p11,(c3,c2)>1p_{1}1, (c_{3}, c_{2})>1.
From (c1,c2)=1(c_{1}, c_{2})=1 we know the product of the smallest prime factors of c1,c2c3108c_{1}, c_{2} \leqslant c_{3} \leqslant 108. Thus qc1q \mid c_{1}.
From (c2,c1)=1,(c2,p1α1p2α2p3a3)=1,{p1,p2,p3,q}={2,3,5,7},c2108(c_{2}, c_{1})=1, (c_{2}, p_{1}^{\alpha_{1}} p_{2}^{\alpha_{2}} p_{3}^{a_{3}})=1, \{p_{1}, p_{2}, p_{3}, q\}=\{2,3,5,7\}, c_{2} \leqslant 108 we know c2c_{2} is a prime number greater than 10.
From (c3,c2)>1(c_{3}, c_{2})>1 we know c2c3c_{2} \mid c_{3}. Also, 11,(c5,c4)>111, (c_{5}, c_{4})>1. So c2c5,c4c5c_{2} \mid c_{5}, c_{4} \mid c_{5}.
From c2c3,(c4,c3)=1c_{2} \mid c_{3}, (c_{4}, c_{3})=1 we know (c2,c4)=1(c_{2}, c_{4})=1. Thus c2c4c5c_{2} c_{4} \mid c_{5}. But c2c411×13>108c_{2} c_{4} \geqslant 11 \times 13 > 108, a contradiction.
Take S1={1,2,,108}/({1}S_{1}=\{1,2, \cdots, 108\} / (\{1\} and primes greater than 11 }{2×3×11,2×3×5,22×3×5,2×32×5,2×3×7,22×3×7,2×5×7,3×5×7})\} \cup \{2 \times 3 \times 11, 2 \times 3 \times 5, 2^{2} \times 3 \times 5, 2 \times 3^{2} \times 5, 2 \times 3 \times 7, 2^{2} \times 3 \times 7, 2 \times 5 \times 7, 3 \times 5 \times 7\}). Then S1=76|S_{1}|=76.
Below we prove that S1S_{1} satisfies (i), (ii).
If p1α1p2α2p3α3S1,p11,(2q1,b)>1p_{1}^{\alpha_{1}} p_{2}^{\alpha_{2}} p_{3}^{\alpha_{3}} \in S_{1}, p_{1}1, (2 q_{1}, b)>1; if b3q1b \neq 3 q_{1}, then 3q1S1,(3q1,a)>13 q_{1} \in S_{1}, (3 q_{1}, a)>1, (3q1,b)>1(3 q_{1}, b)>1.
(2) a=2×3×17,baa=2 \times 3 \times 17, b \neq a, same as (1).
(3) a=ba=b, since at least one of 5,7,115,7,11 does not divide aa, (i) holds.
If aa is composite, take the smallest prime factor pp of aa, then pS1,(p,a)>1p \in S_{1}, (p, a)>1; if aa is prime, then a11a \leqslant 11, 2aS1,(2a,a)>12a \in S_{1}, (2a, a)>1.
(4) a,ba, b are two different numbers in S1S_{1}, a,ba, b each contain at most two different prime factors, a1,(b,r1)>1a1, (b, r_{1})>1;
If r1=r2=ar_{1}=r_{2}=a, then take u=2u=2 or 3, such that buab \neq u a. Then uaS,(ua,a)>1,(ua,b)>1u a \in S, (u a, a)>1, (u a, b)>1.
If r1r2a,r1r2br_{1} r_{2} \neq a, r_{1} r_{2} \neq b, then r1r2S1,(r1r2,a)>1,(r1r2,b)>1r_{1} r_{2} \in S_{1}, (r_{1} r_{2}, a)>1, (r_{1} r_{2}, b)>1.
If r1r2=ar_{1} r_{2}=a, then take u=2u=2 or 3, such that bur1b \neq u r_{1}. Then ur1S,(ur1,a)>1,(ur1,b)>1u r_{1} \in S, (u r_{1}, a)>1, (u r_{1}, b)>1.
If r1r2=br_{1} r_{2}=b, then take v=2,3,5v=2,3,5, such that aur1,bur1a \neq u r_{1}, b \neq u r_{1}, then vr1S1,(vr1,a)>1,(vr1,b)>1v r_{1} \in S_{1}, (v r_{1}, a)>1, (v r_{1}, b)>1.
Therefore, 2×3×5,22×3×5,2×32×5,2×3×7,22×3×7,2×5×7,3×5×72 \times 3 \times 5, 2^{2} \times 3 \times 5, 2 \times 3^{2} \times 5, 2 \times 3 \times 7, 2^{2} \times 3 \times 7, 2 \times 5 \times 7, 3 \times 5 \times 7 do not belong to
SS.
Now we prove: 2×3×11,2×3×13,5×7,72 \times 3 \times 11, 2 \times 3 \times 13, 5 \times 7, 7 \cdots (2) do not belong to SS.
Assume (2) numbers all belong to SS. From (i) we know there exist d1,d2Sd_{1}, d_{2} \in S, such that (2×3×11,d1)=1,(5×7,d1)=1(2 \times 3 \times 11, d_{1})=1, (5 \times 7, d_{1})=1, (2×3×13,d2)=1,(5×7,d2)=1(2 \times 3 \times 13, d_{2})=1, (5 \times 7, d_{2})=1.

Thus d1,d2d_{1}, d_{2} are both primes greater than 10. From (ii) we know d1=d217d_{1}=d_{2} \geqslant 17. From (ii) we know there exists d3Sd_{3} \in S, such that (7,d3)>1,(d2,d3)>1(7, d_{3})>1, (d_{2}, d_{3})>1.
Thus, 7d2d37 d_{2} \mid d_{3}. But 7d27×17=1197 d_{2} \geqslant 7 \times 17=119, a contradiction.
On the other hand, among the primes greater than 10, at most one belongs to S,1SS, 1 \notin S, thus S10871231=76|S| \leqslant 108-7-1-23-1 = 76.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.