sum of integers in one set equals product of integers in other set, mod p
Source: Ukraine TST 2015 p4
May 2, 2020
SumProductnumber theorymodulo
Problem Statement
A prime number is given. Prove that integers less than , 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.