Maths Olympiad Prep

Library / KöMaL problem A /112 of 136

KöMaL problem A, 2026

Algebra Difficulty 8.0 Shortlist Prove it Hungary

Let a0=0<a1<a2<…<ana_0=0<a_1<a_2<\ldots<a_n be integers such that the sequence bk=ak+1−ak2k+1b_k=\frac{a_{k+1}-a_k}{2k+1} (k=0k=0, 1, …\ldots, n−1n-1) is non-decreasing. Suppose that c1c_1, c2c_2, …\ldots, cnc_n are real numbers such that the polynomial 1+∑k=1nckxak1+\sum_{k=1}^n c_kx^{a_k} is divisible by the polynomial (x+1)n(x+1)^n. Show that 2>∣c1∣>∣c2∣>…>∣cn∣2>|c_1|>|c_2|>\ldots>|c_n|.

We don't reproduce this publisher's solutions. Their own solution is here — work the problem first.
Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: KöMaL, licensed Rights held by KöMaL and the MATFUND Foundation. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.