Is the Inverse Element in Modular Arithmetic Unique?

Click For Summary
SUMMARY

The discussion centers on proving the uniqueness of the inverse element in modular arithmetic, specifically within the set Zn. The participants clarify that if x . y = 1 and x . z = 1, then y must equal z, establishing that the inverse element of x in Zn is unique. Key points include the correction of misconceptions regarding the equation xy = n + 1 and the importance of understanding the definition of an inverse element, which is defined as an element y such that xy = 1.

PREREQUISITES
  • Understanding of modular arithmetic, specifically Zn.
  • Familiarity with the concept of multiplicative inverses.
  • Knowledge of commutative properties of multiplication.
  • Basic algebraic manipulation skills.
NEXT STEPS
  • Study the properties of multiplicative inverses in modular arithmetic.
  • Learn about the structure of the group of units in Zn.
  • Explore examples of finding inverses in various modular systems, such as Z12.
  • Investigate the implications of unique inverses in cryptographic applications.
USEFUL FOR

Mathematicians, students studying abstract algebra, and anyone interested in the properties of modular arithmetic and its applications in number theory.

alphamu
Messages
2
Reaction score
0
Question: Let n be a positive integer and consider x,y,z to be elements of Zn. Prove that if x . y = 1 and x . z = 1, then y = z. (Since working in Zn the sign '.' means "multiplication modulo n".)

Conclude that if x has an inverse element in Zn, then the inverse element is unique.

Attempt: Well if x . y = 1 then this means that xy = n + 1 since were working in Zn. This means the same can be said about y . z = 1 that yz = n + 1. This suggests that z = x by substitution. I'm not sure of this is correct or if I'm going down right path here.

Other thing I thought about was multiplying x . y = 1 by z on both sides to prove y=z but I'm a bit stuck.

I'm also a bit confused about the last bit of the question where I have to conclude if x has inverse element (not entirely sure what this is) in Zn then the inverse element is unique.

Can anyone help please?Sent from my iPhone using Physics Forums
 
Physics news on Phys.org
alphamu said:
Question: Let n be a positive integer and consider x,y,z to be elements of Zn. Prove that if x . y = 1 and x . z = 1, then y = z. (Since working in Zn the sign '.' means "multiplication modulo n".)

Conclude that if x has an inverse element in Zn, then the inverse element is unique.

Attempt: Well if x . y = 1 then this means that xy = n + 1 since were working in Zn. This means the same can be said about y . z = 1 that yz = n + 1.
This is NOT true. for example, 5*5= 1 (mod 12) because 5*5= 2(12+ 1). That is, 2n+ 1, NOT n+ 1.

This suggests that z = x by substitution. I'm not sure of this is correct or if I'm going down right path here.

Other thing I thought about was multiplying x . y = 1 by z on both sides to prove y=z but I'm a bit stuck.
Why "a bit stuck"? Where did you get stuck? Since multiplication is commutative, yes, if xy= 1 then zxy= (xz)y= z so y= z.

I'm also a bit confused about the last bit of the question where I have to conclude if x has inverse element (not entirely sure what this is) in Zn then the inverse element is unique.
An "inverse element" of x is another element, y, such that xy= yx= 1. For any "other inverse element", z, xz= 1.

Can anyone help please?


Sent from my iPhone using Physics Forums
I'm a bit puzzled why, on recognizing that you did not know the definitions well ("not entirely sure what this is"), you did not immediately look up and review the definitions.
 

Similar threads

Replies
2
Views
1K
Replies
1
Views
1K
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
4K