Maths Olympiad Prep

Library / /6 of 7

, 2026

Algebra Difficulty 7.0 National Olympiad, round 2 Prove it United Kingdom

Let NN be a positive integer and let (kn)n1(k_n)_{n \geq 1} be a sequence of positive integers with all terms at most NN. Annabel begins by choosing integers x1,x2,,xNx_1, x_2, \ldots, x_N. She then extends this to an infinite sequence (xn)n1(x_n)_{n \geq 1} of integers by defining
xn=i=nknn1xix_n = \sum_{i=n-k_n}^{n-1} x_i
for each n>Nn > N.
Show that there are either finitely many strictly positive terms or finitely many strictly negative terms in the infinite sequence (xn)(x_n).

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: UK Mathematics Trust, licensed © UK Mathematics Trust; question papers published free at bmos.ukmt.org.uk. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.