pigeonhole principle
( plural )
Quizzes for review
(mathematics) The theorem which states that any partition of a finite set of n elements into m (< n) subsets (allowing empty subsets) must include a subset with two or more elements; any of certain reformulations concerning the partition of infinite sets where the cardinality of the unpartitioned set exceeds that of the partition (so there is no one-to-one correspondence).
pigeonhole principle
In combinatorics, the pigeonhole principle guarantees that if you place 13 socks into 12 drawers, at least one drawer contains two or more socks.
In combinatorics, the pigeonhole principle guarantees that if you place 13 socks into 12 drawers, at least one drawer contains two or more socks.
English - English
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1