Problem

Source: III International Festival of Young Mathematicians Sozopol 2012, Theme for 10-12 grade

Tags: number theory



Let $p$ be some odd prime number and let $k=\frac{p+1}{2}$. The natural numbers $a_1,a_2…a_k$ are such that $a_i\neq a_j$ and $a_i<p$ for $\forall i,j=1,2…k$. Prove that for each natural number $r<p$ there exist not necessarily different $a_i$ and $a_j$, for which $a_i a_j\equiv r\, (mod\, p)$.