Pigeonhole riddle

In a collection of \(n+1\) integers, at least how many are congruent modulo \(n\)?

×

Problem Loading...

Note Loading...

Set Loading...