Maths Olympiad Prep

Library / /408 of 520

Combinatorics Difficulty 7.0 National olympiad Prove it

Let pp be an odd prime, and put N=14(p3p)1N=\frac{1}{4}\left(p^{3}-p\right)-1. The numbers 1,2,,N1,2, \ldots, N are painted arbitrarily in two colors, red and blue. For any positive integer nNn \leqslant N, denote by r(n)r(n) the fraction of integers in {1,2,,n}\{1,2, \ldots, n\} that are red. Prove that there exists a positive integer a{1,2,,p1}a \in\{1,2, \ldots, p-1\} such that r(n)a/pr(n) \neq a / p for all n=1,2,,Nn=1,2, \ldots, N. (Netherlands)

Solution

Denote by R(n)R(n) the number of red numbers in {1,2,,n}\{1,2, \ldots, n\}, i.e., R(n)=nr(n)R(n)=n r(n). Similarly, denote by B(n)B(n) and b(n)=B(n)/nb(n)=B(n) / n the number and proportion of blue numbers in {1,2,,n}\{1,2, \ldots, n\}, respectively. Notice that B(n)+R(n)=nB(n)+R(n)=n and b(n)+r(n)=1b(n)+r(n)=1. Therefore, the statement of the problem does not change after swapping the colors. Arguing indirectly, for every a{1,2,,p1}a \in\{1,2, \ldots, p-1\} choose some positive integer nan_{a} such that r(na)=a/pr\left(n_{a}\right)=a / p and, hence, R(na)=ana/pR\left(n_{a}\right)=a n_{a} / p. Clearly, pnap \mid n_{a}, so that na=pman_{a}=p m_{a} for some positive integer mam_{a}, and R(na)=amaR\left(n_{a}\right)=a m_{a}. Without loss of generality, we assume that m1mp1m_{1}m_{p-1}. Choose kk to be the smallest index satisfying mk>mp1m_{k}>m_{p-1}; by our assumptions, we have 1<kq<p11<k \leqslant q<p-1. Let mam_{a} be the maximal number among m1,m2,,mk1m_{1}, m_{2}, \ldots, m_{k-1}; then ak1ma<mp1a \leqslant k-1 \leqslant m_{a}<m_{p-1}. Applying the Claim, we get mkp1kmp1p1kpap(p1)map1k(pk+1)(k1)k1k(p1)(pq)12p212 \begin{aligned} m_{k} \geqslant \frac{p-1}{k} m_{p-1} \geqslant \frac{p-1}{k} & \cdot \frac{p-a}{p-(p-1)} m_{a} \\ & \geqslant \frac{p-1}{k} \cdot(p-k+1)(k-1) \geqslant \frac{k-1}{k} \cdot(p-1)(p-q) \geqslant \frac{1}{2} \cdot \frac{p^{2}-1}{2} \end{aligned} which contradicts (1) again. Comment 1. The argument in Case 2, after a slight modification of estimates at the end, applies as soon as there exists k<3(p+1)4k<\frac{3(p+1)}{4} with ak<ap1a_{k}<a_{p-1}. However, this argument does not seem to work if there is no such kk. Comment 2. If pp is small enough, then one can color {1,2,,N+1}\{1,2, \ldots, N+1\} so that there exist numbers m1m_{1}, m2,,mp1m_{2}, \ldots, m_{p-1} satisfying r(pma)=a/pr\left(p m_{a}\right)=a / p. For p=3,5,7p=3,5,7, one can find colorings providing the following sequences: (m1,m2)=(1,2),(m1,m2,m3,m4)=(1,2,3,6), and (m1,,m6)=(1,2,3,4,6,12) \left(m_{1}, m_{2}\right)=(1,2), \quad\left(m_{1}, m_{2}, m_{3}, m_{4}\right)=(1,2,3,6), \quad \text { and } \quad\left(m_{1}, \ldots, m_{6}\right)=(1,2,3,4,6,12) respectively. Thus, for small values of pp, the number NN in the problem statement cannot be increased. However, a careful analysis of the estimates shows that this number can be slightly increased for p11p \geqslant 11.

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.