# 7. (a) Let p be prime. Suppose a and b are integers such that ab = 0(mod p). Show that either a = 0 or b = 0 (mod p).(b) Show that if a, 6, n are integers with nlab and gcd(a, n) = 1, thenn|b.8. Let p 2 3 be prime. Show that the only solutions to 1' = 1 (mod p)are I = ±1 (mod p). (Hint: Apply Exercise 7(a) to (z+ 1)(1 - 1).)

Question
12 views help_outlineImage Transcriptionclose7. (a) Let p be prime. Suppose a and b are integers such that ab = 0 (mod p). Show that either a = 0 or b = 0 (mod p). (b) Show that if a, 6, n are integers with nlab and gcd(a, n) = 1, then n|b. 8. Let p 2 3 be prime. Show that the only solutions to 1' = 1 (mod p) are I = ±1 (mod p). (Hint: Apply Exercise 7(a) to (z+ 1)(1 - 1).) fullscreen
check_circle

Step 1

Problem 8:

Note that...

### Want to see the full answer?

See Solution

#### Want to see this answer and more?

Solutions are written by subject experts who are available 24/7. Questions are typically answered within 1 hour.*

See Solution
*Response times may vary by subject and question.
Tagged in 