Maths Olympiad Prep

Library / /6 of 10

, 2023

Combinatorics Difficulty 8.6 Shortlist Prove it China

A nonempty set AA of integers is called a “beautiful set” if for any aAa \in A and k{1,2,,2023}k \in \{1, 2, \dots, 2023\}, the set
{bAb3k=a3k} \{b \in A \mid \lfloor \frac{b}{3^k} \rfloor = \lfloor \frac{a}{3^k} \rfloor \}
has exactly 2k2^k elements.
Prove that: if the intersection of an integer set SS and any beautiful set is not empty, then SS contains a beautiful set.

Note: Here x\lfloor x \rfloor represents the greatest integer not exceeding xx.

Solutions — 2

Solution 1

For a positive integer nn, a non-empty set of integers AA is called an “order nn strong beautiful set” if A{0,1,,3n1}A \subset \{0, 1, \dots, 3^n - 1\} and for any aAa \in A and 1kn1 \le k \le n, we have #{bA3kb=3ka}=2k\#\{b \in A \mid \lfloor 3^{-k}b \rfloor = \lfloor 3^{-k}a \rfloor \} = 2^k. It is clear that a 2023-order strong beautiful set is a beautiful set. We will prove the following proposition by induction: For any positive integer nn, if a set of integers SS has a non-empty intersection with every order nn strong beautiful set, then SS contains an order nn strong beautiful set. Taking n=2023n = 2023 in this proposition will imply the original problem.

When n=1n = 1, the order 1 strong beautiful sets are the binary subsets of {0,1,2}\{0, 1, 2\}. It is easy to see that the proposition holds in this case. Suppose the proposition holds for n=mn = m. We will prove that it also holds for n=m+1n = m + 1. First, note that if A1A_1 and A2A_2 are mm-order strong beautiful sets and {i1,i2}\{i_1, i_2\} is a binary subset of {0,1,2}\{0, 1, 2\}, then the set
{a+i13maA1}{a+i23maA2} \{a + i_1 3^m \mid a \in A_1\} \cup \{a + i_2 3^m \mid a \in A_2\}
is an (m+1)(m+1)-order strong beautiful set. Let SS be a set of integers that has a non-empty intersection with every (m+1)(m+1)-order strong beautiful set. Consider the sets
Si={0a<3ma+i3mS},i=0,1,2. S_i = \{0 \le a < 3^m \mid a + i 3^m \in S\}, \quad i = 0, 1, 2.
We claim that there exists a binary subset {i1,i2}\{i_1, i_2\} of {0,1,2}\{0, 1, 2\} such that both Si1S_{i_1} and Si2S_{i_2} have a non-empty intersection with every mm-order strong beautiful set. If not, then there exist a binary subset {j1,j2}\{j_1, j_2\} of {0,1,2}\{0, 1, 2\} and mm-order strong beautiful sets B1B_1 and B2B_2 such that Sj1B2=S_{j_1} \cap B_2 = \emptyset for s=1,2s = 1, 2. As a result, the (m+1)(m+1)-order strong beautiful set {a+j13maB1}{a+j23maB2}\{a + j_1 3^m \mid a \in B_1\} \cup \{a + j_2 3^m \mid a \in B_2\} does not intersect with SS, which is a contradiction. By the induction hypothesis, Si1S_{i_1} contains an mm-order strong beautiful set A1A_1, and Si2S_{i_2} contains an mm-order strong beautiful set A2A_2. Therefore, SS contains an (m+1)(m+1)-order strong beautiful set {a+i13maA1}{a+i23maA2}\{a + i_1 3^m \mid a \in A_1\} \cup \{a + i_2 3^m \mid a \in A_2\}. \square

Solution 2

For a positive integer nn and an integer mm, a non-empty set of integers AA is called an “nn-th order mm-basic beautiful set” if A{3mm,3mm+1,,3n(m+1)1}A \subset \{3^m m, 3^m m + 1, \dots, 3^n(m+1) - 1\} and for any aAa \in A and 1kn1 \le k \le n, we have #{bA3kb=3ka}=2k\#\{b \in A \mid \lfloor 3^{-k}b \rfloor = \lfloor 3^{-k}a \rfloor \} = 2^k. It is clear that for any integer mm, any 2023-th order mm-basic beautiful set is a beautiful set. We will prove the proposition PnP_n by induction: for any set of integers SS and any integer mm, there exists an nn-th order mm-basic beautiful set AA such that either ASA \subset S or ASˉA \subset \bar{S} (where Sˉ=ZS\bar{S} = \mathbb{Z} \setminus S denotes the complement of SS). If P2023P_{2023} is true, then the set SS or its complement Sˉ\bar{S} contains a beautiful set. Since SAS \cap A \ne \emptyset by assumption, it follows that ASA \subset S, and the original problem is solved.

When n=1n = 1, by the pigeonhole principle, the set {3m,3m+1,3m+2}\{3m, 3m + 1, 3m + 2\} contains at least two elements aa and bb that belong to either SS or Sˉ\bar{S}. Then A={a,b}A = \{a, b\} is a 1-st order mm-basic beautiful set, and ASA \subset S or ASˉA \subset \bar{S}. Thus, the proposition P1P_1 holds. Assume that the proposition PnP_n holds. We will prove that the proposition Pn+1P_{n+1} also holds. For any set of integers SS and any integer mm, by the induction hypothesis, there exists an nn-th order 3m3m-basic beautiful set A1[3n3m,3n(3m+1))A_1 \subset [3^n \cdot 3m, 3^n(3m+1)), an nn-th order (3m+1)(3m+1)-basic beautiful set A2[3n(3m+1),3n(3m+2))A_2 \subset [3^n(3m+1), 3^n(3m+2)), and an nn-th order (3m+2)(3m+2)-basic beautiful set A3[3n(3m+2),3n(3m+3))A_3 \subset [3^n(3m+2), 3^n(3m+3)), which satisfy that for any i{1,2,3}i \in \{1, 2, 3\}, either AiSA_i \subset S or AiSˉA_i \subset \bar{S}. According to the pigeonhole principle, at least two sets among A1,A2,A3A_1, A_2, A_3, denoted as Ai1A_{i_1} and Ai2A_{i_2} (1i1<i231 \le i_1 < i_2 \le 3), are both contained in SS or Sˉ\bar{S}. Define A=Ai1Ai2A = A_{i_1} \cup A_{i_2}, it can be easily verified that AA is an (n+1)(n+1)-th order mm-basic beautiful set, and either ASA \subset S or ASˉA \subset \bar{S}. Therefore, the proposition Pn+1P_{n+1} holds. \square

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 and solution reproduced as published; topic and difficulty added by this site.