MHB Show the Units of Zn with modular multiplication are a group

Click For Summary
The discussion focuses on demonstrating that the set of elements in $\Bbb{Z}_n$ that are coprime to n forms a group under modular addition. Key properties such as associativity, identity, and closure have been established, but the challenge lies in proving the existence of inverses. A crucial hint provided is to utilize the relationship that if the greatest common divisor (gcd) of r and n is 1, then there exist integers s and t such that rs + nt = 1. Additionally, taking this equation modulo n can help in finding the necessary inverse. The conversation emphasizes the importance of these mathematical principles in group theory.
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$.
 
Thread 'How to define a vector field?'
Hello! In one book I saw that function ##V## of 3 variables ##V_x, V_y, V_z## (vector field in 3D) can be decomposed in a Taylor series without higher-order terms (partial derivative of second power and higher) at point ##(0,0,0)## such way: I think so: higher-order terms can be neglected because partial derivative of second power and higher are equal to 0. Is this true? And how to define vector field correctly for this case? (In the book I found nothing and my attempt was wrong...

Similar threads

  • · Replies 26 ·
Replies
26
Views
810
  • · Replies 1 ·
Replies
1
Views
486
Replies
48
Views
4K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 17 ·
Replies
17
Views
6K