This is a simple question from Groups and their Graphs by Grossman and Magnus that I just can't figure out:(adsbygoogle = window.adsbygoogle || []).push({});

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.

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Multiplication modulo p

Loading...

Similar Threads for Multiplication modulo |
---|

B Associativity of Matrix multiplication |

**Physics Forums | Science Articles, Homework Help, Discussion**