Let S be a set of k + 1 2 integers. Use the Pigeonhole Principle to show that there are
Chapter 8, Problem 10(choose chapter or problem)
Let S be a set of k + 1 2 integers. Use the Pigeonhole Principle to show that there are at least two integers in S that have the same remainder when divided by k.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer