Suppose X and Y are finite sets, X has more elements than Y, and is a function. By the pigeonhole principle, there exist elements a and b in X such that and . Write a computer algorithm to find such a pair of elements a and b.
To write the computer algorithm for finding pair of elements of and according to the given information.
Suppose and are finite sets and has more elements than ; and is a function. By the pigeonhole principle, there exists elements and in such that and
Let us suppose has elements and has elements
Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!Get Started