Pigeonhole principle: Difference between revisions
Jump to navigation
Jump to search
imported>Subpagination Bot m (Add {{subpages}} and remove any categories (details)) |
imported>Aleksander Stos m (typo) |
||
| Line 1: | Line 1: | ||
{{subpages}} | {{subpages}} | ||
In [[discrete mathematics]], the '''Pigeonhole Principle''' states "if you have ten pigeons and only nine pigeonholes, then at least one of those pigeonholes is shared by more than one pigeon." More formally, for any group of N items which must be assigned to M categories, if N > M, then at least one category must contain more than one item. The pigeonhole | In [[discrete mathematics]], the '''Pigeonhole Principle''' states "if you have ten pigeons and only nine pigeonholes, then at least one of those pigeonholes is shared by more than one pigeon." More formally, for any group of N items which must be assigned to M categories, if N > M, then at least one category must contain more than one item. The pigeonhole principle does not state any more. It does not state how excess items are distributed, or even that all categories are filled. | ||
Revision as of 07:47, 31 December 2007
In discrete mathematics, the Pigeonhole Principle states "if you have ten pigeons and only nine pigeonholes, then at least one of those pigeonholes is shared by more than one pigeon." More formally, for any group of N items which must be assigned to M categories, if N > M, then at least one category must contain more than one item. The pigeonhole principle does not state any more. It does not state how excess items are distributed, or even that all categories are filled.