SOLID STATE PRESS
← Back to catalog
The Pigeonhole Principle cover
Coming soon
Coming soon to Amazon
This title is in our publishing queue.
Browse available titles
Mathematics

The Pigeonhole Principle

Pigeons, Holes, and the Proof You Never Saw Coming — A TLDR Primer

You have a combinatorics exam next week, a math olympiad qualifier coming up, or a discrete math course that just introduced "the pigeonhole principle" — and the textbook's three-sentence explanation left you more confused than when you started. This guide fixes that.

**TLDR: The Pigeonhole Principle** covers everything a high school or early college student needs to actually use this idea: the basic statement and why it is obviously true, the generalized form with ceiling functions, and — most importantly — the skill that separates students who score well from those who don't: figuring out which objects are your "pigeons" and which regions are your "holes." The book works through classic applications in number theory and combinatorics, including divisibility arguments and sum-and-difference problems, then moves into geometric pigeonhole problems where the holes are pieces of a figure.

If you are prepping for AMC, AIME, or a competition math problem-solving course, the pigeonhole principle is one of the most reliable tools in your kit — and this primer gets you contest-ready without wading through a full discrete math textbook. It is also a clean companion for any high school combinatorics study guide or first-semester college discrete math course.

Short by design. Every page earns its place. Read it once, work the examples, and walk into your next exam knowing exactly what to look for.

Get your copy and make the principle click today.

What you'll learn
  • State the pigeonhole principle and its generalized form precisely.
  • Identify the 'pigeons' and 'holes' in a problem and choose them strategically.
  • Apply the principle to classic problems in number theory, geometry, and combinatorics.
  • Recognize when pigeonhole is the right tool and when a different counting argument is needed.
  • Write clean proofs that use pigeonhole as the key step.
What's inside
  1. 1. What the Pigeonhole Principle Actually Says
    Introduces the basic principle, the intuition behind it, and the formal statement, with simple immediate examples.
  2. 2. The Generalized Pigeonhole Principle
    Extends the principle to the case where you have many more pigeons than holes and need at least k in some hole, using ceiling functions.
  3. 3. Choosing Your Pigeons and Holes
    The hardest part of using pigeonhole is deciding what to count; this section walks through how to spot the right pairing in a problem.
  4. 4. Classic Applications in Number Theory and Combinatorics
    Worked examples including divisibility by n, sums and differences, repeated digits, and the friendship theorem warm-up.
  5. 5. Geometric Pigeonhole
    Applies the principle to points in regions, lattice points, and distance arguments, where the holes are pieces of a figure.
  6. 6. When Pigeonhole Works and When It Doesn't
    Discusses limits of the principle, common student mistakes, and how it connects to more advanced tools like probabilistic arguments.
Published by Solid State Press
The Pigeonhole Principle cover
TLDR STUDY GUIDES

The Pigeonhole Principle

Pigeons, Holes, and the Proof You Never Saw Coming — A TLDR Primer
Solid State Press

The Pigeonhole Principle

Pigeons, Holes, and the Proof You Never Saw Coming — A TLDR Primer

Copyright © 2026 Solid State Press.

Published by Solid State Press.

All rights reserved. No part of this book may be reproduced or transmitted in any form without prior written permission, except for brief quotations in critical reviews and educational use.

Part of the TLDR Study Guides series.

Contents

  1. 1 What the Pigeonhole Principle Actually Says
  2. 2 The Generalized Pigeonhole Principle
  3. 3 Choosing Your Pigeons and Holes
  4. 4 Classic Applications in Number Theory and Combinatorics
  5. 5 Geometric Pigeonhole
  6. 6 When Pigeonhole Works and When It Doesn't
Chapter 1

What the Pigeonhole Principle Actually Says

Suppose you have 13 socks in a drawer — six red and seven blue — and you grab socks one at a time in the dark. How many do you need to pull out before you can guarantee a matching pair? Three. By the third sock, you must have repeated a color. You cannot escape it.

That intuition, made precise, is the pigeonhole principle.

The principle, stated plainly: If you distribute $n + 1$ objects among $n$ categories, at least one category must contain at least two objects.

The objects are called pigeons (think of actual pigeons flying into a row of mailboxes), and the categories are called holes (the mailboxes themselves). If there are more pigeons than holes, some hole is stuck with at least two pigeons. No arrangement avoids it.

Here is the formal statement:

If $n+1$ or more pigeons are placed into $n$ holes, then at least one hole contains at least two pigeons.

Equivalently: if every hole held at most one pigeon, you could fit at most $n$ pigeons total. So $n + 1$ pigeons force a repeat.

That's it. The principle itself is almost embarrassingly simple — and that's precisely why it surprises people when it turns out to prove something nontrivial.

Example. In any group of 13 people, at least two must share a birth month.

Solution. There are 12 months (holes) and 13 people (pigeons). Since $13 > 12$, by the pigeonhole principle, at least two people land in the same month — that is, they share a birth month.

Notice what the proof does and does not do. It tells you that two people share a birth month, but it does not tell you which two, or which month they share. This is the key feature of a non-constructive argument: it proves that something exists without exhibiting it.

About This Book

If you are a high school student who has hit a wall on an AMC or AIME math contest prep problem that involves counting, or a student in a discrete math course who needs a fast, clear primer before an exam, this book was written for you. It also works for anyone doing independent study who wants a real explanation of the Pigeonhole Principle — not a one-line definition, but actual understanding.

This combinatorics study guide for high school covers the basic and generalized forms of the principle, then builds toward the kind of number theory proofs that show up on competitions and in early college coursework. You will see it applied to integers, geometry, and graph problems — exactly the competition math problem solving strategies that separate students who recognize the technique from those who stare at the page.

Read straight through in one or two sittings, work every example by hand, then test yourself on the problem set at the end. The whole book is about fifteen pages. No filler.

Keep reading

You've read the first half of Chapter 1. The complete book covers 6 chapters in roughly fifteen pages — readable in one sitting.

Coming soon to Amazon