What is the pigeonhole principle?

If n items are placed into m containers and n > m, then at least one container must hold more than one item. More generally, at least one container holds at least ⌈n/m⌉ items.

What formula does this tool use?

To guarantee at least k items in one container: minimum items = (k − 1) × m + 1. To find the guaranteed maximum load for n items in m containers: ⌊(n − 1) / m⌋ + 1.

What is a real-world example?

With 12 containers (months) and 13 people in a room, the pigeonhole principle guarantees at least two people share a birth month, because 13 = (2 − 1) × 12 + 1. With only 12 people it is still possible for everyone to have a different birth month.

Does the principle tell you which container is full?

No. The pigeonhole principle proves existence only — it guarantees at least one container reaches the load threshold but does not identify which one.

Can containers hold more than the guaranteed amount?

Yes. The guarantee is a lower bound on the maximum load. Individual containers can hold more; the principle only asserts that at least one must reach the stated threshold.

Pigeonhole Principle Calculator

Name: Pigeonhole Principle Calculator
Availability: InStock
Author: Nham Vu

Enter the number of containers and target load to instantly find the minimum items needed to guarantee that outcome by the pigeonhole principle.

Select Mode

Minimum items to guarantee a load of k in one container Guaranteed maximum load for n items across containers

Number of containers (m)

e.g. 12 months, 365 days, 26 letters

Target load (k — items per container)

Minimum k is 2 (at least two items share a container).

Fill in the values and click Calculate.

Classic examples

Scenario	m	k=2 needs
Months of the year	12	13
Days of the week	7	8
Days in a year	365	366
Letters A–Z	26	27
Deck of 52 cards (suits)	4	5

Summary