Define a new operation of addition in Z by x ⊕ y = x + y − 1 with a new multiplication in Z by x y = 1. (a) Is Z a commutative ring with respect to these operations? (b) Find the unity, if one exits. 10. (5 points each) Define a new operation of addition in Z by ry= 1+y-1 with a new multiplication in Z by roy=1. (a) Is Z a commutative ring with respect to these...
2.) Let Z the set of integers and two binary operations on it: Z23(x,y) → xTy = xy + 3x +3y +6 e Z i) Show (Z,L,T)is an integral domain ii) Find the set of units U(Z) 2.) Let Z the set of integers and two binary operations on it: Z23(x,y) → xTy = xy + 3x +3y +6 e Z i) Show (Z,L,T)is an integral domain ii) Find the set of units U(Z)
(5 points each) Define a new operation of addition in Z by x Oy = x + y - 1 with a new multiplication in Z by x Oy = 1. (a) Is Z a commutative ring with respect to these operations? (b) Find the unity, if one exits.
10. (10 points) Define a relation on Z by setting x R y if xy is even. a. Give a counterexample to show that is not reflexive. b. Give a counterexample to show that R is not transitive.
12. Let g(x), h(y) and p(z) be functions and define f(x, y, z) = g(x)h(y)p(2). Let R= = {(x, y, z) E R3: a < x <b,c sy <d, eszsf} where a, b, c, d, e and f are constants. Prove the following result SS1, 5100,2)AV = L*()dx ["Mwdy ['Plzdz.
6. Convert .3710 to a binary fraction of 10 binary digits. 7. Use two's compliment arithmetic to perform the following 8 bit binary operations. a. 0010 1110 + 0001 1011 b. 0101 1101 – 0011 1010 c. 1011 1000 – 1000 1011 d. 1000 1100 – 1111 0111 8. Convert 150.8476562510 to IEEE Floating Point Standard. 9. Simplify the following Boolean expressions. a. xy + xy + xz b. (w + x)(x + y)(w + x + y + z)...
2) Let X = {ai, a2. аз-G4.a5} be a set equipped with two binary relations *1 and #2 with the following tables 2a12345 (a) Are *1 and *2 binary operations? (b Are both of these relations associative? (c) Is there is any identity element? (d) If yes, write the identity element (s)? 2) Let X = {ai, a2. аз-G4.a5} be a set equipped with two binary relations *1 and #2 with the following tables 2a12345 (a) Are *1 and *2...
2. (a) Prove by structural induction that for all x E {0,1}*, \x = x. (b) Consider the function reverse : {0,1}* + {0,1}* which reverses a binary string, e.g, reverse(01001) = 10010. Give an inductive definition for reverse. (Assume that we defined {0,1}* and concatenation of binary strings as we did in lecture.) (c) Using your inductive definition, prove that for all x, y E {0,1}*, reverse(xy) = reverse(y)reverse(x). (You may assume that concatenation is associative, i.e., for all...
1. Let B-(0, 1). Define x + y max(x, y) and x . y-min(x, y), and let the complement of x of be 1-x (ordinary subtraction). Show whether or not B forms a Boolean algebra under these operations. 2. Let S-(0,1 R, and T = { y : 2 < y < 12). Find a one to one correspondence (the actual function) between S and T showing they have the same cardinality. (hint: look at straight lines in the xy-plane)...
using discrete structures 3. Consider the function F(x, y, z) for x, y, z z 0 defined as follows: a. F(x, y, 0)-y+1 b. F(x, 0, 1)-x c, F(x, 0, 2) = 0 d. F(x, 0, z+ 3)-1 e. F(x, y, z)-F(x, F(x, y-1, z), z-1) Using Induction, prove the following a. F(x, y, 1)-x +y b, F(x, y, 2) = xy c. F(x, y, 3)-xy 3. Consider the function F(x, y, z) for x, y, z z 0 defined...