Exercise · ZW-PIGEONHOLE-PRINCIPLE-006 · ★★☆ Intermediate

How many integers must be chosen at minimum to guarantee two with the same remainder when divided by 7?

Choose one option.

Show answer
  • A. \(8\)

Explanation

There are 7 possible remainders (0 to 6), the boxes; with 8 integers one repeats.

Study Discrete mathematics in ZWMath →

Review the concept: Pigeonhole principle

If \(n\) objects are placed in \(k\) boxes, some box holds at least \(\lceil n/k\rceil\) objects, and in particular two when \(n>k\).

\[\left\lceil \dfrac{n}{k}\right\rceil\]

More practice problems: pigeonhole principle

← ZW-PIGEONHOLE-PRINCIPLE-005 ZW-PIGEONHOLE-PRINCIPLE-007 →