Proving Congruence Classes: [a][b]=1 iff gcd(a,n)=1

  • Thread starter Thread starter Juanriq
  • Start date Start date
  • Tags Tags
    Classes
Juanriq
Messages
39
Reaction score
0
Salutations! I believe I have one implications correct and I am looking for a push in the right direction for the other.

Homework Statement


Let n be an integer and let [a] \in \thinspace \mathbb{Z}_n. Prove that there exists and element <b> \in \thinspace \mathbb{Z}_n</b> such that [a]<b> = 1</b> if and only if \gcd (a,n) = 1.


2. The attempt at a solution
For the (\Longleftarrow)case, we know that the \gcd( a, n ) = 1 and we are trying to show [a] = [1] in \mathbb{Z}_n We know that \exists x,y \in \mathbb{Z} such that
ax + ny = 1 \Longrightarrow ax - 1 = -ny but this implies that a b - 1 = vy , where x = b and v = -n and also v| ab - 1.



Now, for the other implications... uh little lost. [a] = [1] implies [ab] = [1]. Can I say that [0] = [n], so [1] = [n+1] = [n] + [1], therefore [ab] - [n] = [1]?

Thanks in advance!
 
Physics news on Phys.org
You have [ab] = [1] in Zn. What does that mean in Z?
 
In Z, it would mean that b is the multiplicative inverse of a, right? In Z we would just have ab = 1
 
Yes, if ab = 1 in Z, that's right. What I actually wanted was for you to translate this statement as is into Z; that is, tell me what this equivalence class equality means. You've already done this to prove the backwards implication, so you know how. But it's the right place to start.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top