- #1
koukou
- 5
- 0
prove Byron's Conjecture. Define the set
Znx={k∈Zn but not including zero :gcd(k; n) = 1}
(a) Prove that Znx is a group under multiplication (mod n).
(b) Prove that an element a∈Zn is invertible in Zn (with respect to multiplication (mod n)) if and only if a∈Znx
Znx x should be above n . i don't know how to type
Znx={k∈Zn but not including zero :gcd(k; n) = 1}
(a) Prove that Znx is a group under multiplication (mod n).
(b) Prove that an element a∈Zn is invertible in Zn (with respect to multiplication (mod n)) if and only if a∈Znx
Znx x should be above n . i don't know how to type