Maths Olympiad Prep

Library / /31 of 97

Number theory Difficulty 7.7 National olympiad, round 2 Find the answer

S S is a non-empty subset of the set {1,2,,108} \{ 1, 2, \cdots, 108 \}, satisfying:

(1) For any two numbers a,bS a,b \in S ( may not distinct), there exists cS c \in S, such that gcd(a,c)\equalgcd(b,c)\equal1 \gcd(a,c)\equal{}\gcd(b,c)\equal{}1.

(2) For any two numbers a,bS a,b \in S ( may not distinct), there exists cS c' \in S, ca c' \neq a, cb c' \neq b, such that gcd(a,c)>1 \gcd(a, c') > 1, gcd(b,c)>1 \gcd(b,c') >1.

Find the largest possible value of S |S|.

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

Solution

Let S S be a non-empty subset of the set {1,2,,108} \{ 1, 2, \ldots, 108 \} satisfying the following conditions:

1. For any two numbers a,bS a, b \in S (not necessarily distinct), there exists cS c \in S such that gcd(a,c)=gcd(b,c)=1 \gcd(a, c) = \gcd(b, c) = 1 .
2. For any two numbers a,bS a, b \in S (not necessarily distinct), there exists cS c' \in S , ca c' \neq a , cb c' \neq b , such that gcd(a,c)>1 \gcd(a, c') > 1 and gcd(b,c)>1 \gcd(b, c') > 1 .

We claim that the largest possible value of S |S| is 79 \boxed{79} .

To construct such a set S S , consider the set T T of positive integers less than or equal to 108 which have either 1 or 2 prime divisors among the set {2,3,5,7,11} \{2, 3, 5, 7, 11\} . By removing the elements 55 and 77 from T T and adding the elements 30, 60, 90, 42, and 84, we obtain a set of 79 elements that satisfies the given conditions.

To show that this is optimal, we proceed with the following lemmas and cases:

Lemma 1: There are at most 2 primes in S S which are greater than 7.
- Proof: Suppose primes p1,p2>7 p_1, p_2 > 7 were both in S S . Applying the second condition on them leads to a contradiction.

Lemma 2: 1S 1 \notin S .
- Proof: Applying the second condition on a=b=1 a = b = 1 leads to a contradiction.

Using Lemmas 1 and 2, we can bound S |S| by 84. We now consider two main cases:

Case 1: There is no prime p>7 p > 7 in S S .
- Among the pairs (6,35),(10,21),(14,15),(2,105),(3,70),(5,42),(7,30) (6, 35), (10, 21), (14, 15), (2, 105), (3, 70), (5, 42), (7, 30) , at least one number in each pair must not be in S S . This reduces the upper bound from 84 to 77, which is less than 79.

Case 2: There is a prime p>7 p > 7 in S S .
- We examine subcases where one of 2,3 2, 3 is not in S S . If 2S 2 \notin S , then either one of 4,8,16,32,64 4, 8, 16, 32, 64 is in S S or S79 |S| \leq 79 . If 3S 3 \notin S , then either one of 9,27,81 9, 27, 81 is in S S or S79 |S| \leq 79 . By similar logic, we can assume 2,3S 2, 3 \in S .

- We further consider subcases where 2,3 2, 3 are in S S but 5,7 5, 7 may or may not be in S S . Each subcase analysis shows that the upper bound is reduced to 79.

Thus, by exhausting all cases and subcases, we have shown that the maximum size of S S is 79.

The answer is 79\boxed{79}.

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