Maths Olympiad Prep

Library / /186 of 520

Combinatorics Difficulty 6.2 National olympiad Find the answer

Determine the number of sets A={a1,a2,,a1000}A=\left\{a_{1}, a_{2}, \ldots, a_{1000}\right\} of positive integers with a1<a2<<a10002014a_{1}<a_{2}<\ldots<a_{1000} \leq 2014, for which the set

S={ai+aj1i,j1000 and i+jA} S=\left\{a_{i}+a_{j} \mid 1 \leq i, j \leq 1000 \text { and } i+j \in A\right\}

is a subset of AA.

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

Solution

We prove that there are 2142^{14} such sets. In particular, we prove that the sets AA that satisfy the conditions are of the form BCB \cup C, with CC a subset of {2001,,2014}\{2001, \ldots, 2014\} and B={1,2,,1000C}B=\{1,2, \ldots, 1000-|C|\}. Call sets of this form "nice". Since there are 2142^{14} subsets of {2001,,2014}\{2001, \ldots, 2014\}, there are 2142^{14} nice sets. We first show that every nice set AA satisfies the conditions. Suppose that i,j1000i, j \leq 1000 with i+jAi+j \in A. Then i+j2000i+j \leq 2000, so i+jBi+j \in B. There thus exists a kk with k1000Ck \leq 1000-|C| such that i+j=ak(=k)i+j=a_{k}(=k). Since ak1000Ca_{k} \leq 1000-|C|, it also holds that i,j1000Ci, j \leq 1000-|C|, so ai=ia_{i}=i and aj=ja_{j}=j. This means ai+aj=i+j=aka_{i}+a_{j}=i+j=a_{k} and that is an element of AA. Therefore, every element of SS is an element of AA, which implies that AA satisfies the conditions.
We now show that every set AA that satisfies the conditions is nice. Suppose first that there exists a kk with 1k10001 \leq k \leq 1000 such that ak{1001,,2000}a_{k} \in\{1001, \ldots, 2000\}. Then ak=1000+ia_{k}=1000+i for some ii with i1000i \leq 1000, so a1000+aia_{1000}+a_{i} is an element of SS and must therefore also be an element of AA. However, a1000+ai>a1000a_{1000}+a_{i}>a_{1000}, a contradiction. Therefore, such an aka_{k} cannot occur. This means that AA can be written as the disjoint union BCB \cup C, with C{2001,,2014}C \subseteq\{2001, \ldots, 2014\} and B{1,2,,1000}B \subseteq\{1,2, \ldots, 1000\}. Let bb be the number of elements of BB. Then b986b \geq 986, because CC has at most 14 elements. To prove that AA is nice, we need to prove that B={1,2,,b}B=\{1,2, \ldots, b\}. It is sufficient to prove that aba_{b}, the largest element of BB, is equal to bb. Therefore, assume for the sake of contradiction that ab>ba_{b}>b. For ii with i=abbi=a_{b}-b it then holds that b+i=ab1000b+i=a_{b} \leq 1000, so i1000b14<bi \leq 1000-b \leq 14<b. Therefore, ai1000a_{i} \leq 1000 and thus ab+aia_{b}+a_{i} \leq 2000. Since i+b=abAi+b=a_{b} \in A, it follows that ab+aiSAa_{b}+a_{i} \in S \subset A, but then ab+aia_{b}+a_{i} is a larger element of BB than aba_{b}, the maximal element. Contradiction. Therefore, ab=ba_{b}=b, which implies that B={1,2,,b}B=\{1,2, \ldots, b\}. Thus, AA is nice.

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.