Suppose b is any integer. If b mod 12 = 7, what is 8b mod 12? In other words, if division of b by 12 gives a remainder of 7, what is the remainder when 8b 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. . Multiply both sides of this equation by 8 and then simplify the right-hand side to find values of q Because b mod 12 = 7, there is an integer m such that b = 12m + 7 and r such that 8b = 12q + r with 0 ≤r< 12. The result is q= and r= Now 0 ≤r< 12, and q is an integer becaus remainder obtained when 8b is divided by 1 ---Select--- ***** products and differences of integers are integers EX products and sums of integers are integers products of integers are integers So the uniqueness part of the quotient remainder theorem guarantees that the

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
Suppose b is any integer. If b mod 12 = 7, what is 8b mod 12? In other words, if division of b by 12 gives a remainder of 7, what is the remainder when 8b 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.
. Multiply both sides of this equation by 8 and then simplify the right-hand side to find values of q
Because b mod 12 = 7, there is an integer m such that b = 12m + 7
and r such that 8b = 12q + r with 0 ≤r< 12. The result is
q=
and r =
Now 0 ≤r < 12, and q is an integer because products and differences of integers are integersex
remainder obtained when 8b is divided by 12 is 62
x.
So the uniqueness part of the quotient remainder theorem guarantees that the
Transcribed Image Text:Suppose b is any integer. If b mod 12 = 7, what is 8b mod 12? In other words, if division of b by 12 gives a remainder of 7, what is the remainder when 8b 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. . Multiply both sides of this equation by 8 and then simplify the right-hand side to find values of q Because b mod 12 = 7, there is an integer m such that b = 12m + 7 and r such that 8b = 12q + r with 0 ≤r< 12. The result is q= and r = Now 0 ≤r < 12, and q is an integer because products and differences of integers are integersex remainder obtained when 8b is divided by 12 is 62 x. So the uniqueness part of the quotient remainder theorem guarantees that the
Suppose b is any integer. If b mod 12 = 7, what is 8b mod 12? In other words, if division of b by 12 gives a remainder of 7, what is the remainder when 8b 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.
Multiply both sides of this equation by 8 and then simplify the right-hand side to find values of q
Because b mod 12 = 7, there is an integer m such that b = 12m + 7
and r such that 8b = 12q + r with 0 ≤r < 12. The result is
q=
and r=
Now 0 ≤r< 12, and q is an integer becaus
remainder obtained when 8b is divided by 1
---Select---
*****
✓ products and differences of integers are integers 3X
products and sums of integers are integers
products of integers are integers
So the uniqueness part of the quotient remainder theorem guarantees that the
Transcribed Image Text:Suppose b is any integer. If b mod 12 = 7, what is 8b mod 12? In other words, if division of b by 12 gives a remainder of 7, what is the remainder when 8b 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. Multiply both sides of this equation by 8 and then simplify the right-hand side to find values of q Because b mod 12 = 7, there is an integer m such that b = 12m + 7 and r such that 8b = 12q + r with 0 ≤r < 12. The result is q= and r= Now 0 ≤r< 12, and q is an integer becaus remainder obtained when 8b is divided by 1 ---Select--- ***** ✓ products and differences of integers are integers 3X products and sums of integers are integers products of integers are integers So the uniqueness part of the quotient remainder theorem guarantees that the
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,