# Question about onto functions

Not what you're looking for? Search our solutions OR ask your own Custom question.

Let P be the power set of {A, B} and let S be the set of all binary strings of length 2. A function f: P -> S is defined as follows: For A in P, f(A) has a 1 in the high-order bit position (left end of string) if and only if a is in A. f(A) has a 1 in the low-order bit position (right end of string) if and only if b is in A. Is f one-to-one? Prove or disprove. Is f onto? Prove or disprove.

Â© BrainMass Inc. brainmass.com December 24, 2021, 5:01 pm ad1c9bdddfhttps://brainmass.com/math/graphs-and-functions/question-about-onto-functions-22609

#### Solution Summary

This is a proof regarding one-to-one and onto functions.

$2.49