×
Get Full Access to Discrete Mathematics And Its Applications - 7 Edition - Chapter 4.3 - Problem 50e
Get Full Access to Discrete Mathematics And Its Applications - 7 Edition - Chapter 4.3 - Problem 50e

×

# Show that if a, b, and m are integers such that m ? 2 and

ISBN: 9780073383095 37

## Solution for problem 50E Chapter 4.3

Discrete Mathematics and Its Applications | 7th Edition

• Textbook Solutions
• 2901 Step-by-step solutions solved by professors and subject experts
• Get 24/7 help from StudySoup virtual teaching assistants

Discrete Mathematics and Its Applications | 7th Edition

4 5 1 417 Reviews
30
0
Problem 50E

Show that if a, b, and m are integers such that m ≥ 2 and a ≡ b (mod m), then gcd(a, m) = gcd(b, m).

Step-by-Step Solution:

Solution :

Step 1 :

In this problem we have to prove that

Given that

Consider  and

Step 2 of 3

Step 3 of 3

##### ISBN: 9780073383095

Since the solution to 50E from 4.3 chapter was answered, more than 310 students have viewed the full step-by-step answer. The full step-by-step solution to problem: 50E from chapter: 4.3 was answered by , our top Math solution expert on 06/21/17, 07:45AM. This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7. The answer to “Show that if a, b, and m are integers such that m ? 2 and a ? b (mod m), then gcd(a, m) = gcd(b, m).” is broken down into a number of easy to follow steps, and 26 words. Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095. This full solution covers the following key subjects: gcd, mod, integers, show, such. This expansive textbook survival guide covers 101 chapters, and 4221 solutions.

#### Related chapters

Unlock Textbook Solution