Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:pigeonhole_principle
|
| gptkbp:appliesTo |
gptkb:probability_theory
computer science number theory counting problems |
| gptkbp:category |
elementary mathematics
|
| gptkbp:field |
gptkb:combinatorics
gptkb:mathematics |
| gptkbp:formedBy |
1834
|
| gptkbp:namedAfter |
gptkb:Peter_Gustav_Lejeune_Dirichlet
|
| gptkbp:relatedTo |
gptkb:infinite_pigeonhole_principle
|
| gptkbp:sentence |
If n+1 objects are placed into n boxes, then at least one box contains more than one object.
|
| gptkbp:usedFor |
proof by contradiction
|
| gptkbp:bfsParent |
gptkb:Peter_Gustav_Lejeune_Dirichlet
gptkb:Johann_Peter_Gustav_Lejeune_Dirichlet |
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Dirichlet principle
|