There is a natural relationship between sets and bit strings which is called the characteristic vector for a set. We’ll look only at subsets of the universe U = {0, . . . , n − 1} for some n, but the concept can be generalised to arbitrary sets.
For a set S ⊆ U, the characteristic vector is denoted by χS and is an n-bit string where bit j is 1 if and only if j ∈ S.
For example, with n = 4 and S = {1, 3} we have χS = 1010.
a) What are χ∅ and χU ?
b) Given χS and χT , what is the characteristic vector of S ∩ T?
( c) Suppose you are given χS and χT . In terms of S and T, what set is χS | χT the characteristic vector for?
There is a natural relationship between sets and bit strings which is called the characteristic vector...
There is a natural relationship between sets and bit strings which is called the characteristic vector for a set. We'll look only at subsets of the universe U = {0, … , n-1} for some n, but the concept can be generalised to arbitrary sets. For a set S C U, the characteristic vector is denoted by xs and is an n-bit string where bit j is 1 if and only if j E S. For example, with n 4...
Let TRm → Rn be a linear transformation, and let p be a vector and S a set in R Show that the image of p + S under T is the translated set T(p) + T(S) n R What would be the first step in translating p+ S? OA. Rewrite p+ S so that it does not use sets. O B. Rewrite p+S so that it does not use vectors O c. Rewrite p + S as a difference...
2. 9 marks] Strings. Consider the following definitions on strings Let U be the set of all strings Let s be a string. The length or size of a string, denoted Is, is the number of characters in s Let s be a string, and i e N such that 0 < ί < sl. We write s[i] to represent the character of s at index i, where indexing starts at 0 (so s 0] is the first character, and...
2. 9 marks] Strings. Consider the following definitions on strings Let U be the set of all strings. Let s be a string. The length or size of a string, denoted Is, is the number of characters in s Let s be a string, and ie N such that 0 Si< Is. We write si] to represent the character of s at index i, where indexing starts at 0 (so s(0 is the first character, and s|s -1 is the...
Sets,
Please respond ASAP,
Thank you
2)
Recall another notation for the natural numbers, N, is Z+. We similarly define the negative integers by: 2. Too, for any set A and a e R, define: and Let B={x: x E Z+ & x is odd } (Recall a number I is said to be odd if 2k +1 for some k e z) Assume Z is our underlying background set for this problem. (a) Write an expression for 3 +...
5-13 please
Homework on sets 1. let the universe be the set U (1,23. .,1.0), A (147,10), B- (1,2 list the elements for the following sets. a. B'nt C-A) b. B-A c. ΒΔΑ 2. Show that A (3,2,1] and B (1,2,3) are equal 3. Show that X Ixe Rand x > 0 and x < 3j and ( 1,2) are equal. 5. Use a Ven diagram and shade the given set. (cnA)-(B-Arnc) Show that A (x| x3-2x2-x+2 O) is not...
Problem 5 Let U be an n dimensional vector space and T E L(U,U). Let I denote the identity transformation I(u) = u for each u EU and let 0 denote the zero transformation. Show that there is a natural number N, and constants C1, ..., CN+1 such that C1I + c2T + ... + CN+1TN = 0 (Hint: Given dim(U) = n, what is the dimension of L(U,U)? consider ciI + c2T + ... + Cn+11'" = 0, where...
2. Which of the following sets are convex? (a) A slab, i.e., a set of the forn {rE Rn l α-ar-β} (b) A rectangle, i.e., a set of the forin {2. E Rn | Qi-Z'i is sometimes called a hyperrectangle when n > 2. ,n). A rectangle A, i = 1, (d) The set of points closer to a given point than a given set, i.e., where SCR (e) The set of points closer to one set than another, i.e.,...
QUESTION 10 The equality relationon any set S is: A total ordering and a function with an inverse. An equivalence relation and also function with an inverse. A function with an inverse, and an equivalence relation with as single equivalence class equal to S An equivalence relation and also a total ordering QUESTION 11 A binary operation on a set S, takes any two elements a,b E S and produces another element c e S. Examples of binary operations include...
Please answer question 3
Find all (infinitely many) solutions of the system of congruence's: Use Fermata little theorem to find 8^223 mod 11. (You are not allowed to use modular exponentiation.) Show that if p f a, then a^y-2 is an inverse of a modulo p. Use this observation to compute an inverse 2 modulo 7. What is the decryption function for an affine cipher if the encryption function is 13x + 17 (mod 26)? Encode and then decode the...