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

×

# Show that an inverse of a modulo m. where a is an integer ISBN: 9780073383095 37

## Solution for problem 8E Chapter 4.4

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 239 Reviews
31
0
Problem 8E

Problem 8E

Show that an inverse of a modulo m. where a is an integer and m > 2 is a positive integer, does not exist if gcd (a, m) > 1.

Step-by-Step Solution:

Solution

In this question we have to show that  an inverse of a modulo m. where a is an integer and m > 2 is a positive integer, does not exist if gcd (a, m) > 1.

Step 1

Here we use the method of contradiction

Let there be an integer x.

Such that So , it means that there exists an integer j such that => Step 2 of 2

##### ISBN: 9780073383095

Unlock Textbook Solution