Chapter 4: Q34E (page 256)
34. Find the one’s complement representations, using bit strings of length six, of the following integers.
(a) 22 b) 31 c) −7 d) −19
Short Answer
The one’s complement representations, using bit strings of length six
Chapter 4: Q34E (page 256)
34. Find the one’s complement representations, using bit strings of length six, of the following integers.
(a) 22 b) 31 c) −7 d) −19
The one’s complement representations, using bit strings of length six
All the tools & learning materials you need for study success - in one app.
Get started for free33. Show that a positive integer is divisible by 3 if and only if the difference of the sum of its binary digits in even numbered positions and the sum of its binary digits in odd-numbered positions is divisible by 3.
The value of the Euler -function at the positive integer is defined to be the number of positive integers less than or equal to that are relatively prime to. [Note: is the Greek letter phi.]
Find these values of the Euler -function.
a)role="math" localid="1668504243797" b)role="math" localid="1668504251452" c)role="math" localid="1668504258881"
Which positive integers less than 12 are relatively prime to 12?
Determine whether the integers in each of these sets are Pairwise relatively prime.
a) 21, 34, 55 b) 14, 17, 85
c) 25, 41, 49, 64 d) 17, 18, 19, 23
Answer Exercise 36 for two's complement expansions.
36. If m is a positive integer less thanhow is the one's complement representation of -m obtained from the one's complement of m, when bit strings of length n are used?
What do you think about this solution?
We value your feedback to improve our textbook solutions.