Maths Olympiad Prep

Track / Stage 7 / 298 of 300 #1698 of 1964

Problem 1698

National olympiad second round; IMO P1/P4
Combinatorics Difficulty 8.0 Prove it

Let p>3p >3 be a prime number. For each nonempty subset TT of {0,1,2,3,,p1}\{0,1,2,3, \ldots , p-1\}, let E(T)E(T) be the set of all (p1)(p-1)-tuples (x1,,xp1)(x_1, \ldots ,x_{p-1} ), where each xiTx_i \in T and x1+2x2++(p1)xp1x_1+2x_2+ \ldots + (p-1)x_{p-1} is divisible by pp and let E(T)|E(T)| denote the number of elements in E(T)E(T). Prove that

E({0,1,3})E({0,1,2})|E(\{0,1,3\})| \geq |E(\{0,1,2\})|

with equality if and only if p=5p = 5.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

1. Define the generating functions:
Let f(x)=1+x+x2 f(x) = 1 + x + x^2 and F(x)=f(x)f(x2)f(xp1) F(x) = f(x) f(x^2) \cdots f(x^{p-1}) . Then, F(x)=n=0p(p1)anxn F(x) = \sum_{n=0}^{p(p-1)} a_n x^n , where an a_n is the number of (p1)(p-1)-tuples (x1,,xp1)(x_1, \ldots, x_{p-1}) with xj{0,1,2} x_j \in \{0, 1, 2\} such that x1+2x2++(p1)xp1=n x_1 + 2x_2 + \cdots + (p-1)x_{p-1} = n .

2. **Count the tuples for E({0,1,2}) E(\{0,1,2\}) :**
The number E({0,1,2}) |E(\{0,1,2\})| is the sum of an a_n for n n divisible by p p . Using roots of unity, let ω=e2πi/p \omega = e^{2\pi i / p} . We know that:
1+ωj+ω2j++ω(p1)j={pif pj0if pj 1 + \omega^j + \omega^{2j} + \cdots + \omega^{(p-1)j} = \begin{cases} p & \text{if } p \mid j \\ 0 & \text{if } p \nmid j \end{cases}
Therefore, summing F(x) F(x) for x=1,ω,ω2,,ωp1 x = 1, \omega, \omega^2, \ldots, \omega^{p-1} :
F(1)+F(ω)++F(ωp1)=pE({0,1,2}) F(1) + F(\omega) + \cdots + F(\omega^{p-1}) = p |E(\{0,1,2\})|
Notice that F(1)=3p1 F(1) = 3^{p-1} . For j0modp j \neq 0 \mod p , (1,ωj,ω2j,,ω(p1)j) (1, \omega^j, \omega^{2j}, \ldots, \omega^{(p-1)j}) is a permutation of (1,ω,ω2,,ωp1) (1, \omega, \omega^2, \ldots, \omega^{p-1}) . Thus:
F(ω)=F(ω2)==F(ωp1)=1 F(\omega) = F(\omega^2) = \cdots = F(\omega^{p-1}) = 1
Hence:
pE({0,1,2})=3p1+(p1)1 p |E(\{0,1,2\})| = 3^{p-1} + (p-1) \cdot 1
E({0,1,2})=3p1+p1p |E(\{0,1,2\})| = \frac{3^{p-1} + p - 1}{p}

3. **Count the tuples for E({0,1,3}) E(\{0,1,3\}) :**
Let g(x)=1+x2+x3 g(x) = 1 + x^2 + x^3 and G(x)=g(x)g(x2)g(xp1) G(x) = g(x) g(x^2) \cdots g(x^{p-1}) . Similarly, we have:
E({0,1,3})=G(1)+(p1)G(ω)p |E(\{0,1,3\})| = \frac{G(1) + (p-1)G(\omega)}{p}
G(1)=3p1 G(1) = 3^{p-1}
We need to show that 1G(ω) 1 \leq G(\omega) and equality holds only for p=5 p = 5 .

4. **Analyze G(ω) G(\omega) :**
Let h(x)=x3+x+1 h(x) = x^3 + x + 1 . The roots of h(x) h(x) are complex numbers λ,μ,ν \lambda, \mu, \nu with λ+μ+ν=0 \lambda + \mu + \nu = 0 . We have:
G(ω)=j=1p1(1+ωj+ω3j)=j=1p1(ωjλ)(ωjμ)(ωjν) G(\omega) = \prod_{j=1}^{p-1} (1 + \omega^j + \omega^{3j}) = \prod_{j=1}^{p-1} (\omega^j - \lambda)(\omega^j - \mu)(\omega^j - \nu)
Using the identity j=1p1(xωj)=xp1x1 \prod_{j=1}^{p-1} (x - \omega^j) = \frac{x^p - 1}{x - 1} for x=λ,μ,ν x = \lambda, \mu, \nu :
G(ω)=(λp1λ1)(μp1μ1)(νp1ν1) G(\omega) = \left( \frac{\lambda^p - 1}{\lambda - 1} \right) \left( \frac{\mu^p - 1}{\mu - 1} \right) \left( \frac{\nu^p - 1}{\nu - 1} \right)
Since (λ1)(μ1)(ν1)=h(1)=3 (\lambda - 1)(\mu - 1)(\nu - 1) = -h(1) = -3 , we have:
(λp1)(μp1)(νp1)=3 (\lambda^p - 1)(\mu^p - 1)(\nu^p - 1) = -3
Given λ3+λ+1=0 \lambda^3 + \lambda + 1 = 0 , for all natural numbers k k , λk+3+λk+1+λk=0 \lambda^{k+3} + \lambda^{k+1} + \lambda^k = 0 . By induction, λr+μr+νrZ \lambda^r + \mu^r + \nu^r \in \mathbb{Z} .

5. **Show G(ω)1 G(\omega) \geq 1 :**
Assume G(ω)=1 G(\omega) = 1 . Then:
(λp1)(μp1)(νp1)=3 (\lambda^p - 1)(\mu^p - 1)(\nu^p - 1) = -3
The roots λp,μp,νp \lambda^p, \mu^p, \nu^p satisfy m(x)=x3qx2+(1+q)x+1=0 m(x) = x^3 - qx^2 + (1+q)x + 1 = 0 with q=λp+μp+νpZ q = \lambda^p + \mu^p + \nu^p \in \mathbb{Z} . Since λ \lambda is the real root of x3+x+1=0 x^3 + x + 1 = 0 and 1<λ<12 -1 < \lambda < -\frac{1}{2} , if q<0 q < 0 , then m(λp)0 m(\lambda^p) \neq 0 , leading to a contradiction. Thus, 1q 1 \leq q .

6. **Special case for p=5 p = 5 :**
For p=5 p = 5 , g(ω)=1+ω+ω2=ω2(1+ω2) g(\omega) = 1 + \omega + \omega^2 = -\omega^2(1 + \omega^2) , and:
G(ω)=j=1p1(1+ω2j)=j=1p1(1+ωj)=1(1)p1(1)=1 G(\omega) = \prod_{j=1}^{p-1} (1 + \omega^{2j}) = \prod_{j=1}^{p-1} (1 + \omega^j) = \frac{1 - (-1)^p}{1 - (-1)} = 1
Therefore:
E({0,1,3})=3p1+(p1)G(ω)p=3p1+p1p |E(\{0,1,3\})| = \frac{3^{p-1} + (p-1)G(\omega)}{p} = \frac{3^{p-1} + p - 1}{p}
Hence, E({0,1,3})=E({0,1,2}) |E(\{0,1,3\})| = |E(\{0,1,2\})| for p=5 p = 5 .

7. Conclusion:
For p>3 p > 3 , E({0,1,3})E({0,1,2}) |E(\{0,1,3\})| \geq |E(\{0,1,2\})| with equality if and only if p=5 p = 5 .

\blacksquare

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.