   Chapter 7.2, Problem 58ES ### 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

# Write a computer algorithm to check whether a function from one finite set to another is onto. Assume the existence of an independent algorithm to compute values of an independent algorithm to compute values of an independent algorithm to compute values of the function.

To determine

To find:

A computer algorithm for checking whether a function from one finite set to another is onto.

Explanation

Given information:

Assume that the existence of an independent algorithom for computing values of the function.

Concept used:

One-to-one function: The distinct elements in domain are mapped with distinct elements in co-domain.

Onto function: Every element in co-domain must be mapped with the element in domain.

Calculation:

Suppose X={x1,x2,.....,xn} and Y={y1,y2,......,ym}.

Then f:XY is onto if and only if for every yj in Y, there exist an element xiX such that f(xi)=yj.

Domain of f: one dimensional array a,a,

### 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 