Basis Lab

Counting Without Listing

More Things Than Places

Last timeCounting the Same Thing Twice

If there are more things than places, two of them share. The certain version is obvious; the probable version arrives far sooner than intuition allows, and it is why collisions must be designed for.

Thirteen people are in a room. Two of them were born in the same month.

That is not a probability, it is a certainty, and the argument takes one line:

there are twelve months, and if every month held at most one person the room

could not hold more than twelve.

FIG 1The argument, written out once
stepstepthe claimwhy
1suppose notsuppose no two people share a monththis is the thing to be ruled out
2what that meanseach of the twelve months holds at most one personthat is what sharing nothing means
3count the peoplethen the room holds at most twelve peopletwelve months, at most one each
4butthe room holds thirteengiven
5sothe supposition is impossible, and two people share a monththere is no other way out
6notice what was not usednothing about who the people are or how birthdays are distributedwhich is why the conclusion is a certainty rather than a probability
6 steps
The last line is the whole value of this argument. Every other result in this course needed an assumption about how outcomes were distributed, and this one needs none, which is why it can rule things out rather than merely make them unlikely. The general form is just as short: n items in k boxes forces some box to hold at least n divided by k rounded up, so twenty five people in twelve months force three to share. That is a guarantee about the worst arrangement, and the distance between the guarantee and the typical case is the subject of the rest of the lesson.

Two consequences of that one line argument are worth having, because neither

is obvious.

No compression scheme can shrink every input. If it could, then every file of a

thousand bits would map to some shorter file, and there are fewer short files

than thousand bit files, so two different inputs would compress to the same

thing and could not both be recovered. That is the pigeonhole principle and

nothing else, and it settles a claim that otherwise invites endless argument.

In any group of people, two of them have the same number of friends within the

group, provided nobody is friends with themself and the group is larger than

one. The possible friend counts in a group of n people run from nought to n

minus one, which is n values, but nought and n minus one cannot both occur, so

there are really n minus one available values for n people.

Likely long before it is certain

The certainty needs three hundred and sixty six people to force a shared

birthday. The interesting number is far smaller, and the fourth lesson already

produced it.

The lesson stops here

2 more paragraphs to go

You have read the opening. The rest of the argument, the problems that check whether it landed, and the lines worth keeping at the end all come with a plan.

The first lesson of every course in the library reads the whole way through, free, so you can see exactly what the rest of them are.

See the planThe contents

This is the reading half

Starting the course gives you your own copy of it. Every idea on every page has problems standing under it, marked with a reason rather than a tick, and any sentence you do not believe can be opened and argued with. None of that can happen on a page nobody owns.

The contents

The rest of this course

  1. 01One Choice After Another
  2. 02Putting Things in Orderopening only
  3. 03When Order Does Not Matteropening only
  4. 04Putting It Back, or Notopening only
  5. 05Counting Turns Into Chanceopening only
  6. 06Counting the Same Thing Twiceopening only
  7. 07More Things Than Placesyou are here
  8. 08When Counting Explodesopening only

Read alongside