Let [unparseable or potentially dangerous latex formula] be a prime and let [unparseable or potentially dangerous latex formula] are integers not divisible by [unparseable or potentially dangerous latex formula], such that
[unparseable or potentially dangerous latex formula] for any integer [unparseable or potentially dangerous latex formula] not divisible by [unparseable or potentially dangerous latex formula].
Prove that at least [unparseable or potentially dangerous latex formula] of the pairwise sums of [unparseable or potentially dangerous latex formula] are divisible by [unparseable or potentially dangerous latex formula].
([unparseable or potentially dangerous latex formula] is the fractional part of [unparseable or potentially dangerous latex formula])