Suppose b is any integer. If b mod 12 = 5, what is 6b mod 12? In other words, if division of b by 12 gives a remainder of 5, what is the remainder when 6b is divided by 12? Fill in the blanks to show that the same answer will be obtained no matter what integer is used for b at the start. Because b mod 12 = 5, there is an integer m such that b = 12m + 12m + 5 1. Multiply both sides of this equation by 6 and then simplify the right-hand side to find values of g and r such that 6b = 12g +r with osr< 12. The results is and r= Now 0sr< 12, and a is an integer because -Select--- V. So the uniqueness part of the quotient remainder theorem guarantees that the remainder obtained when 6b is divided by 12 is

Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter2: The Integers
Section2.5: Congruence Of Integers
Problem 58E: a. Prove that 10n(1)n(mod11) for every positive integer n. b. Prove that a positive integer z is...
icon
Related questions
icon
Concept explainers
Topic Video
Question

help

Suppose b is any integer. If b mod 12 = 5, what is 6b mod 12? In other words, if division of b by 12 gives a remainder of 5, what is the remainder when 6b is divided by 12? Fill in the blanks to show that the same answer will be obtained no matter
what integer is used for b at the start.
Because b mod 12 = 5, there is an integer m such that b = 12m + 12m + 5
|. Multiply both sides of this equation by 6 and then simplify the right-hand side to find values of q and r such that 6b = 12g +r with 0sr< 12. The results is
and r=
Now 0sr< 12, and g is an integer because --Select--
So the uniqueness part of the quotient remainder theorem guarantees that the remainder obtained when 6b is divided by 12 is
Transcribed Image Text:Suppose b is any integer. If b mod 12 = 5, what is 6b mod 12? In other words, if division of b by 12 gives a remainder of 5, what is the remainder when 6b is divided by 12? Fill in the blanks to show that the same answer will be obtained no matter what integer is used for b at the start. Because b mod 12 = 5, there is an integer m such that b = 12m + 12m + 5 |. Multiply both sides of this equation by 6 and then simplify the right-hand side to find values of q and r such that 6b = 12g +r with 0sr< 12. The results is and r= Now 0sr< 12, and g is an integer because --Select-- So the uniqueness part of the quotient remainder theorem guarantees that the remainder obtained when 6b is divided by 12 is
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps

Blurred answer
Knowledge Booster
Application of Algebra
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Elements Of Modern Algebra
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,