Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Dirichlet's_box_principle
|
| gptkbp:category |
elementary combinatorial principle
|
| gptkbp:describes |
if n items are put into m containers and n > m, then at least one container has more than one item
|
| gptkbp:field |
gptkb:mathematics
combinatorics |
| gptkbp:firstDescribed |
1834
|
| gptkbp:formedBy |
gptkb:Peter_Gustav_Lejeune_Dirichlet
|
| https://www.w3.org/2000/01/rdf-schema#label |
pigeonhole principle
|
| gptkbp:relatedTo |
gptkb:Ramsey_theory
gptkb:infinite_pigeonhole_principle birthday problem |
| gptkbp:sentence |
If more objects are placed into fewer boxes, then at least one box contains more than one object.
|
| gptkbp:usedIn |
gptkb:probability_theory
computer science number theory proofs |
| gptkbp:bfsParent |
gptkb:Ramsey's_theorem
|
| gptkbp:bfsLayer |
5
|