Show the Units of Zn with modular multiplication are a group

Click For Summary
SUMMARY

The discussion centers on demonstrating that the set of elements in $\Bbb{Z}_n$ that are coprime to n, denoted as U_n, forms a group under modular addition. Key properties such as associativity, identity, and closure have been established. The primary challenge lies in proving the existence of an inverse for each element in U_n. The solution involves utilizing the property that if gcd(r, n) = 1, then there exist integers s and t such that rs + nt = 1, which can be manipulated to find the necessary inverse.

PREREQUISITES
  • Understanding of modular arithmetic and groups
  • Familiarity with the concept of coprimality
  • Knowledge of the Euclidean algorithm for computing gcd
  • Basic algebraic manipulation of equations
NEXT STEPS
  • Study the properties of groups in abstract algebra
  • Learn about the Extended Euclidean Algorithm for finding integer solutions
  • Explore modular multiplicative inverses in number theory
  • Research the structure of the group of units in modular arithmetic
USEFUL FOR

Mathematicians, students of abstract algebra, and anyone interested in number theory and group theory will benefit from this discussion.

E01
Messages
8
Reaction score
0
I am trying to do an exercise where I am showing that the set of all elements of $\Bbb{Z}_n$ that are coprime with n form a group under modular addition.

So far I have shown associativity, identity, and closure, but I'm having trouble showing the existence of an inverse. I know I can't use reciprocals and I can't find a way to prove that for $r \in U_n$ there exists some $t \in U_n$ such that $tr$ has a remainder of 1 when divided by n.

Any hints?
 
Physics news on Phys.org
E01 said:
I am trying to do an exercise where I am showing that the set of all elements of $\Bbb{Z}_n$ that are coprime with n form a group under modular addition.

So far I have shown associativity, identity, and closure, but I'm having trouble showing the existence of an inverse. I know I can't use reciprocals and I can't find a way to prove that for $r \in U_n$ there exists some $t \in U_n$ such that $tr$ has a remainder of 1 when divided by n.

Any hints?

Hi E01,

Use the fact that $gcd(r,n) = 1$ if and only if there exist integers $s$ and $t$ such that $rs + nt = 1$.
 
E01 said:
I am trying to do an exercise where I am showing that the set of all elements of $\Bbb{Z}_n$ that are coprime with n form a group under modular addition.

So far I have shown associativity, identity, and closure, but I'm having trouble showing the existence of an inverse. I know I can't use reciprocals and I can't find a way to prove that for $r \in U_n$ there exists some $t \in U_n$ such that $tr$ has a remainder of 1 when divided by n.

Any hints?

Hint #2: take Euge's equation mod $n$.
 

Similar threads

  • · Replies 26 ·
Replies
26
Views
944
Replies
48
Views
4K
  • · Replies 1 ·
Replies
1
Views
621
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 17 ·
Replies
17
Views
7K