   Chapter 9.4, Problem 40ES ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193

#### Solutions

Chapter
Section ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193
Textbook Problem
1 views

# Suppose X and Y are finite sets, X has more elements than Y, and F : X → Y is a function. By the pigeonhole principle, there exist elements a and b in X such that a ≠ b and F ( a ) = F ( b ) . Write a computer algorithm to find such a pair of elements a and b.

To determine

To write the computer algorithm for finding pair of elements of a and b according to the given information.

Explanation

Given information:

Suppose X and Y are finite sets and X has more elements than Y ; and F:XY is a function. By the pigeonhole principle, there exists elements a and b in X such that ab and F(a)=F(b)

Calculation:

Let us suppose X has m elements and Y has n elements

### Still sussing out bartleby?

Check out a sample textbook solution.

See a sample solution

#### The Solution to Your Study Problems

Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!

Get Started 