Question: 1 A = 1 0 0 | 1 1 0 | 0 0 1 and B = 0 1 1 | 1 0 1 |
1
| A = |
| and | B = |
|
|---|
Given matrices A and B, find the join, meet and Boolean product of A and B.
2.What is the binary expansion of ( 10010111 )2 ( 0110111 )2? (You must do the product in base 2, NOT base 10. Show all work. The answer must be a 16-bit binary number.)
3.Use the Euclidean algorithm to find
gcd ( 2041, 343 )
the Bezout identity for a, above (in the form gcd ( 2041, 343 ) = s 2041 + t 343).
4.Find the prime factorization of 61013. You must show all work, and make use of the theorem: if n is composite, i.e., n = ab, then a < n or b < n.
5.
| a. | 100 j=5 | j3 2j 4 |
|---|---|---|
| b. | 25 j=1 | 3j |
Find the values of each of the following:
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
