Chapter 4: Q21E (page 244)
Evaluate these quantities.
a) 13 mod 3
b)−97 mod 11
c) 155 mod 19
d)−221 mod 23
Short Answer
- 1
- 2
- 3
- 9
Chapter 4: Q21E (page 244)
Evaluate these quantities.
a) 13 mod 3
b)−97 mod 11
c) 155 mod 19
d)−221 mod 23
All the tools & learning materials you need for study success - in one app.
Get started for freeUse the extended Euclidean algorithm to express gcd(144,89) as a linear combination of 144 and 89.
Show that if aand d are positive integers, then there are integers and rsuch that a = dq + r where -d/2 < r < d/2 .
Show that ifis an odd prime, then for some nonnegative integer . [Hint: First show that the polynomial identity holds, whereand is odd.]
Show that the octal expansion of a positive integer can be obtained from its binary expansion by grouping together blocks of three binary digits, adding initial zeros if necessary, and translating each block of three binary digits into a single octal digit.
32. Show that a positive integer is divisible by 11 if and only if the difference of the sum of its decimal digits in even- numbered positions and the sum of its decimal digits in odd-numbered positions is divisible by 11.
What do you think about this solution?
We value your feedback to improve our textbook solutions.