n must divide one of z_i [ILL 1977]
Source:
January 11, 2011
pigeonhole principlemodular arithmeticnumber theory proposednumber theory
Problem Statement
Let and be integers greater than and . Prove:
(a) At least one of the numbers is divisible by .
(b) If , then at least one of the numbers is divisible by .