Topics: Discrete Mathematics
Let be positive integers. The pigeonhole principle tells us that if items are put into containers, with , then at least one container must contain more than one item.
Search
Topics: Discrete Mathematics
Let m,n be positive integers. The pigeonhole principle tells us that if n items are put into m containers, with n>m, then at least one container must contain more than one item.