Mathematics Homework Solutions
#22609
Functions
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.
This is a proof regarding one-to-one and onto functions.
What is this?
By OTA - Overall OTA Rating
Changping Wang, MA - 4.9/5
Purchase Cost Now
$2.19 CAD (was ~$7.98)
Included in Download
- Plain text response
- Attached file(s):
- discrete3.doc
Why you can trust BrainMass.com
- Your Information is Secure
- Best Online Academic Help Service
- Students find real academic Success
- Onto or One-to-one - let f(s) = string s with 01100 concatenated. Example: f(0000) = 000001100 Show: a) the range of f b) f is onto c) f is one-one
- Set Partitions and Bit Strings - Which of these collections of subsets are partitions on the set of bit strings of length 8? a) The set of bit strings that end with 00; the set of bit strings that end with 01; the set of bit strin ...
- n-Bit Binary Strings with Fixed Digits - I need to show that the number of n-bit binary strings that contain exactly two occurrences of 10 is C(n+1, 5).
- Binary to Decimal Conversion - The binary expansion of an integer is 101001. Show how you compute the equivalent decimal value.
- Ordered Pairs and Sets and Set Operations ( Complement, Union and Intersection ) - 1. a) Recall that ordered pairs must have the property that (x,y) = (u,v) if and only if x = u and y = v. Prove that {{x}, {x,y}} = {{u}, {u,v}} if and only if x = u and y = v. Therefore, although ...
