Problem

Source: Ukraine TST 2015 p4

Tags: Sum, Product, number theory, modulo



A prime number $p> 3$ is given. Prove that integers less than $p$, it is possible to divide them into two non-empty sets such that the sum of the numbers in the first set will be congruent modulo p to the product of the numbers in the second set.