×
×

# Show that if p and q are distinct prime numbers, then pq-1 ISBN: 9780073383095 37

## Solution for problem 41E Chapter 4.SE

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 259 Reviews
15
2
Problem 41E

Show that if p and q are distinct prime numbers, then pq-1 + qp-l = 1 (mod pq).

Step-by-Step Solution:

SOLUTIONStep 1In this problem, we have to show that when p and q are distinct prime numbers.Step 2Since p and q are both prime numbers, they are not divisible by each other.Therefore by using the FERMAT’S LITTLE THEOREM we get ……(1)And ……(2)Step 3We know that p divides and q divides .Therefore we get that...

Step 2 of 3

Step 3 of 3

##### ISBN: 9780073383095

This full solution covers the following key subjects: mod, initial, determined, digit, digits. This expansive textbook survival guide covers 101 chapters, and 4221 solutions. The answer to “Show that if p and q are distinct prime numbers, then pq-1 + qp-l = 1 (mod pq).” is broken down into a number of easy to follow steps, and 18 words. Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095. The full step-by-step solution to problem: 41E from chapter: 4.SE was answered by , our top Math solution expert on 06/21/17, 07:45AM. Since the solution to 41E from 4.SE chapter was answered, more than 261 students have viewed the full step-by-step answer. This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7.

Unlock Textbook Solution