Chapter 4: Q25SE (page 307)
Use the Euclidean algorithm to find the greatest common divisor of 10,223 and 33,341 .
The greatest common divisor of10,223 and 33,341 is 1
Over 30 million students worldwide already upgrade their learning with Vaia!
All the tools & learning materials you need for study success - in one app.
Get started for free
a) Define what it means for a and b to be congruent m odulo 7.
b) Which pairs of the integers-11,-8,-7,-1,0,3 and 17are congruent ?
c) Show that ifa and bare congruent m odulo 7, then 10a+13 and -4b+20 are also congruent m odulo 7.
39. Show that the integer m with one’s complement representation can be found using the equation
35. What integer does each of the following one’s complement representations of length five represent?
a) 11001 b) 01101 c) 10001 d) 11111
What is the least common multiple of each pair in Exercise 25?
a)
b)
c)
d)
e)
f) 1111, 0
37. How is the one’s complement representation of the sum of two integers obtained from the one’s complement representations of these integers?
What do you think about this solution?
We value your feedback to improve our textbook solutions.
