Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:pigeonhole_principle
|
| gptkbp:appliesTo |
finite sets
|
| gptkbp:category |
elementary mathematics
|
| gptkbp:field |
combinatorics
|
| gptkbp:firstStated |
1834
|
| gptkbp:generalizes |
If N objects are placed into k boxes, then at least one box contains at least ceiling(N/k) objects.
|
| https://www.w3.org/2000/01/rdf-schema#label |
Dirichlet's box principle
|
| gptkbp:namedAfter |
gptkb:Peter_Gustav_Lejeune_Dirichlet
|
| gptkbp:sentence |
If n+1 objects are placed into n boxes, then at least one box contains more than one object.
|
| gptkbp:usedIn |
gptkb:probability_theory
computer science discrete mathematics number theory |
| gptkbp:bfsParent |
gptkb:pigeonhole_principle
|
| gptkbp:bfsLayer |
6
|