Olympiad Maths Prep

Library / /8 of 19

Combinatorics Difficulty 6.0 National olympiad Prove it Mongolia

Let {1,2,,2009}A={a1,,ak}\{1, 2, \ldots, 2009\} \supseteq A = \{a_1, \ldots, a_k\}. Find all AA sets such that 2009i=1kai2009 \mid \sum_{i=1}^{k} a_i.
(proposed by B. Bayasgalan)

Solution

Those ziz_i are odd numbered 2n2nth root of unity. In the figure regular nn-gon.
Consider following function's decomposition. f(x)=(1+x)(1+x2)(1+xn)f(x) = (1+x)(1+x^2)\ldots(1+x^n). Then xkx^k's coefficient is a set whose sum of elements. We need to find xkx^k's sum of coefficients, which is denoted by AnA_n. Here n=2009n = 2009. Now consider that sum f(ε)+f(ε2)++f(εn)f(\varepsilon) + f(\varepsilon^2) + \ldots + f(\varepsilon^n), here ε=cos2πn+isin2πn\varepsilon = \cos \frac{2\pi}{n} + i \sin \frac{2\pi}{n}. We know that ε+ε2++εn=0\varepsilon + \varepsilon^2 + \ldots + \varepsilon^n = 0 then we can easily see that k=1nf(εk)=nAn\sum_{k=1}^{n} f(\varepsilon^k) = n \cdot A_n. Now compute the f(εk)f(\varepsilon^k), Assume d=(k,n)d = (k, n). Then f(εd)=f(εk)f(\varepsilon^d) = f(\varepsilon^k). Otherwise, numbers of all dd such that d=(k,n)d = (k, n) is φ(nd)\varphi\left(\frac{n}{d}\right). Also,
f(εd)=(1+εd)d(1+ε2d)d(1+εn/d)d f(\varepsilon^d) = (1+\varepsilon^d)^d (1+\varepsilon^{2d})^d \dots (1+\varepsilon^{n/d})^d
and easy calculation, we get
f(εd)=[(1+εd)(1+ε2d)(1+εndd)]d f(\varepsilon^d) = \left[ (1 + \varepsilon^d)(1 + \varepsilon^{2d})\dots(1 + \varepsilon^{\frac{n}{d} \cdot d}) \right]^d
Because of xn1=k=1n(xεk)x^n - 1 = \prod_{k=1}^{n} (x - \varepsilon^k) then substituting x=1x = -1, we get (1)n1=(1)nf(ε)(-1)^n - 1 = (-1)^n f(\varepsilon), In other word f(ε)=1+(1)n+1f(\varepsilon) = 1 + (-1)^{n+1}. Observe that (εd)nd=1(\varepsilon^d)^{\frac{n}{d}} = 1, we get f(εd)=(1+(1)nd+1)df(\varepsilon^d) = (1 + (-1)^{\frac{n}{d}+1})^d. Finally
nAn=dnφ(nd)(1+(1)nd+1)d. n \cdot A_n = \sum_{d|n} \varphi\left(\frac{n}{d}\right) \cdot \left(1 + (-1)^{\frac{n}{d}+1}\right)^d.

Looking for a route rather than 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.