×
Log in to StudySoup
Get Full Access to Math - Textbook Survival Guide
Join StudySoup for FREE
Get Full Access to Math - Textbook Survival Guide

Show that an inverse of a modulo m. where a is an integer

Discrete Mathematics and Its Applications | 7th Edition | ISBN: 9780073383095 | Authors: Kenneth Rosen 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 | ISBN: 9780073383095 | Authors: Kenneth Rosen

Discrete Mathematics and Its Applications | 7th Edition

4 5 0 286 Reviews
31
0
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:

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 </p>

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

Chapter 4.4, Problem 8E is Solved
Textbook: Discrete Mathematics and Its Applications
Edition: 7
Author: Kenneth Rosen
ISBN: 9780073383095

Unlock Textbook Solution

Enter your email below to unlock your verified solution to:

Show that an inverse of a modulo m. where a is an integer

×
Log in to StudySoup
Get Full Access to Math - Textbook Survival Guide
Join StudySoup for FREE
Get Full Access to Math - Textbook Survival Guide
×
Reset your password