- #1
ForMyThunder
- 149
- 0
This is a simple question from Groups and their Graphs by Grossman and Magnus that I just can't figure out:
Consider the set {1, 2, 3,..., p-1} where p is a prime number, with binary operation "multiplication modulo p." Show that for any element x of the set there is an element y of the set such that xy [tex]\equiv[/tex] 1 (mod p).
I've gotten as far as having to show that x|(np+1) for some integer n.
Consider the set {1, 2, 3,..., p-1} where p is a prime number, with binary operation "multiplication modulo p." Show that for any element x of the set there is an element y of the set such that xy [tex]\equiv[/tex] 1 (mod p).
I've gotten as far as having to show that x|(np+1) for some integer n.