Related questions with answers
Question
Let X={a, b, c}. Define a function S from (X) to the set of bit strings of length 3 as follows. Let YX. If aY, set ; If aY, set ; If bY, set ; If bY, set ; If cY, set ; If cY, set . Define S(Y)=.
Prove that S is onto.
Solution
VerifiedStep 1
1 of 3DEFINITIONS
A relation is a when and implies .
The is the set of all possible first elements in the ordered pairs.
Notation: dom
The is the set of all possible second elements in the ordered pairs.
Notation: im
The function is whenever implies .
The function is if for element there exist an element such that .
The function has an if and only if is one-to-one and onto.
Create an account to view solutions
By signing up, you accept Quizlet's Terms of Service and Privacy Policy
Create an account to view solutions
By signing up, you accept Quizlet's Terms of Service and Privacy Policy
Recommended textbook solutions

Discrete Mathematics and Its Applications
7th Edition•ISBN: 9780073383095Kenneth Rosen4,283 solutions


Discrete Mathematics and Its Applications
8th Edition•ISBN: 9781259676512Kenneth Rosen4,397 solutions

More related questions
1/4
1/7