- #1
fishturtle1
- 394
- 82
Homework Statement
In class yesterday we were learning about Z/mZ* where m is any nonnegative integer. At the very end(no time left), the teacher showed in Z/12Z* = {1, 5, 7, 11}, every element is its own inverse.
So ##1*1 \equiv 1 \operatorname{(mod p)}##
##5*5 \equiv 1 \operatorname{(modp)}##.. etc.
So I want to prove: Let ##x \epsilon \mathbb{Z}/m\mathbb{Z}^*##. Then ##x = x^{-1}##, that is ##x^2 \equiv 1 \operatorname{(mod p)}.##
Homework Equations
The Attempt at a Solution
Suppose ##x \epsilon \mathbb{Z}/m\mathbb{Z}^*##. Then ##\gcd(a, m) = 1##. So
##au + mv = 1## for some integers u, v. We calculate ##(au)^2 = (1 - mv)^2## and get ##a^2u^2 = m^2v^2 - 2mv + 1##... but there's no way to say ##u = 1## so i don't think this is the way..
I think I can prove this for prime numbers..Edit2: Never mind I think i just showed 1^2 = 1...
Edit1: Let ##x \epsilon \mathbb{Z}/p\mathbb{Z}^*## where p is prime. Then ##\gcd(x,p) = 1##. So ##x^{p-1} \equiv 1 \operatorname{(mod p)}##. Then ##x^{p-1}x^{p-1} = x^{2(p-1)} = x^{{(p-1)}^2} \equiv 1^2 = 1 \operatorname{(modp)}##
Last edited: