Statements (25)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Dirichlet's_box_principle
|
| gptkbp:appliesTo |
infinite sets
finite sets |
| gptkbp:basicStatement |
If n items are put into m containers, with n > m, then at least one container must contain more than one item.
|
| gptkbp:category |
elementary mathematics
combinatorial principles |
| gptkbp:example |
If 367 people are in a room, at least two share a birthday.
If 13 people are in a room, at least two share a birth month. |
| gptkbp:field |
gptkb:mathematics
combinatorics |
| gptkbp:formedBy |
gptkb:Peter_Gustav_Lejeune_Dirichlet
1834 |
| https://www.w3.org/2000/01/rdf-schema#label |
Pigeonhole Principle
|
| gptkbp:notableFor |
gptkb:Ramsey_theory
coding theory graph theory |
| gptkbp:relatedConcept |
gptkb:infinite_pigeonhole_principle
generalized pigeonhole principle |
| gptkbp:usedIn |
gptkb:probability_theory
computer science number theory proofs |
| gptkbp:bfsParent |
gptkb:Introductory_Combinatorics
|
| gptkbp:bfsLayer |
8
|