Let $a_1<a_2<\cdots<a_n$ be positive integers. Some colouring of $\mathbb{Z}$ is periodic with period $t$ such that for each $x\in \mathbb{Z}$ exactly one of $x+a_1,x+a_2,\dots,x+a_n$ is coloured. Prove that $n\mid t$. Andrei Radulescu-Banu
Problem
Source: Romanian IMO Team Selection Test TST 1991, problem 14
Tags: function, combinatorics proposed, combinatorics