Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

IMC / 2018 / Problems / Day 1, P5

IMC 2018 · Day 1 · P5

killer

Let pp and qq be prime numbers with p<qp < q. Suppose that in a convex polygon P1P2PpqP_1 P_2 \dots P_{pq} all angles are equal and the side lengths are distinct positive integers. Prove that P1P2+P2P3++PkPk+1k3+k2P_1 P_2 + P_2 P_3 + \dots + P_k P_{k+1} \ge \frac{k^3 + k}{2} holds for every integer kk with 1kp1 \le k \le p.

(Proposed by Ander Lamaison Vidarte, Berlin Mathematical School, Berlin)

Solution (official)

Place the polygon in the complex plane counterclockwise, so that P2P1P_2 - P_1 is a positive real number. Let ai=Pi+2Pi+1a_i = |P_{i+2} - P_{i+1}|, which is an integer, and define the polynomial f(x)=apq1xpq1++a1x+a0f(x) = a_{pq-1} x^{pq-1} + \dots + a_1 x + a_0. Let ω=e2πipq\omega = e^{\frac{2\pi i}{pq}}; then Pi+1Pi=ai1ωi1P_{i+1} - P_i = a_{i-1} \omega^{i-1}, so f(ω)=0f(\omega) = 0.

The minimal polynomial of ω\omega over Q[x]\mathbb{Q}[x] is the cyclotomic polynomial Φpq(x)=(xpq1)(x1)(xp1)(xq1)\Phi_{pq}(x) = \frac{(x^{pq} - 1)(x - 1)} {(x^p - 1)(x^q - 1)}, so Φpq(x)\Phi_{pq}(x) divides f(x)f(x). At the same time, Φpq(x)\Phi_{pq}(x) is the greatest common divisor of s(x)=xpq1xp1=Φq(xp)s(x) = \frac{x^{pq} - 1}{x^p - 1} = \Phi_q(x^p) and t(x)=xpq1xq1=Φp(xq)t(x) = \frac{x^{pq} - 1}{x^q - 1} = \Phi_p(x^q), so by Bézout's identity (for real polynomials), we can write f(x)=s(x)u(x)+t(x)v(x)f(x) = s(x) u(x) + t(x) v(x), with some polynomials u(x),v(x)u(x), v(x). These polynomials can be replaced by u(x)=u(x)+w(x)xp1x1u^*(x) = u(x) + w(x) \frac{x^p - 1}{x - 1} and v(x)=v(x)w(x)xq1x1v^*(x) = v(x) - w(x) \frac{x^q - 1}{x - 1}, so without loss of generality we may assume that degup1\deg u \le p - 1. Since dega=pq1\deg a = pq - 1, this forces degvq1\deg v \le q - 1.

Let u(x)=up1xp1++u1x+u0u(x) = u_{p-1} x^{p-1} + \dots + u_1 x + u_0 and v(x)=vq1xq1++v1x+v0v(x) = v_{q-1} x^{q-1} + \dots + v_1 x + v_0. Denote by (i,j)(i, j) the unique integer n{0,1,,pq1}n \in \{0, 1, \dots, pq-1\} with ni(modp)n \equiv i \pmod p and nj(modq)n \equiv j \pmod q. By the choice of ss and tt, we have a(i,j)=ui+vja_{(i,j)} = u_i + v_j. Then P1P2++PkPk+1=i=0k1a(i,i)=i=0k1(ui+vi)=1ki=0k1j=0k1(ui+vj)=1ki=0k1j=0k1a(i,j)()1k(1+2++k2)=k3+k2\begin{align*} P_1 P_2 + \dots + P_k P_{k+1} &= \sum_{i=0}^{k-1} a_{(i,i)} = \sum_{i=0}^{k-1} (u_i + v_i) = \frac1k \sum_{i=0}^{k-1} \sum_{j=0}^{k-1} (u_i + v_j) \\ &= \frac1k \sum_{i=0}^{k-1} \sum_{j=0}^{k-1} a_{(i,j)} \overset{(*)}{\ge} \frac1k \bigl( 1 + 2 + \dots + k^2 \bigr) = \frac{k^3 + k}{2} \end{align*} where ()(*) uses the fact that the numbers (i,j)(i, j) are pairwise different.

How the field did

contestants scored
342
average (of 10)
0.45
solved (≥ 80%)
2.9%
near-0 (≤ 10%)
93.9%
discrimination
0.39

Score distribution (field cohort)

Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.

Similar problems

IMC 2023 · Day 1 · P4killeravg 1.0/10 · solved 3% · near-0 82% · disc 0.41
IMC 1999 · Day 2 · P12killeravg 0.4/10 · solved 2% · near-0 91% · disc 0.30
IMC 2009 · Day 1 · P5killeravg 0.5/10 · solved 4% · near-0 92% · disc 0.28
IMC 2016 · Day 1 · P5killeravg 0.3/10 · solved 2% · near-0 96% · disc 0.29