Y by
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.


We have your learning goals covered with Spring and Summer courses available. Enroll today!
Something appears to not have loaded correctly.