Abstract algebra
Show that one cannot define division in Z_n for any arbitrary positive integer n. When division is possible in Z_n ?
@Kainui
@pooja195
@ganeshie8
@lochana
you can divide by \(a\) only if the inverse exists for \(a\) under modulus \(n\)
Its \[Z_n\]
\(\mathbb{Z}_n = \{0,1,2,\ldots, n-1\}\) is the set of least nonnegative residues under modulus \(n\) right ?
yeah correct
\(\dfrac{b}{a} = ba^{-1}\) First, notice that division by \(a\) is well defined only if the multiplicative inverse of \(a\) exists under modulus \(n\)
yeah......
Next, how do you find the inverse of \(a\) under modulus \(n\) ?
\[[1/2]=[0]\]
???
lets take Z_6 here
you get the multiplicative inverse of \(a\) by solving : \[ax\equiv 1\pmod{n}\] yes ?
how good are you with congruence s?
I know the meanings and few theorems.
that should do :)
ok..:)
lets take \(\mathbb{Z}_6\) maybe, just for working an example
ok..:)
let \(a=5\) whats the inverse of \(a\) in \(\mathbb{Z}_6\) ?
w.r.t multi[lication ?? or division?
i never heard of an inverse with respect to division before
w.r.t multiplication, yes :)
its 5 itself
Yes, what about the multiplicative inverse of 4 ?
4 dont have any multiplicative inverse since the multiplicative invers exists iff gcd(a,n)=1 where a belongs to Zn
so you do know the criterion for existence of inverses
yeah, for multiplication i know. but the question is asked about division
we define division using multiplication : \(\dfrac{b}{a} = ba^{-1}\)
ohkay,,,:)
let me ask you a question
consider two cases : 1) \(n\) is composite, 2) \(n\) is prime
For each case, what can you say about the existence of inverse for each of the elements in \(\mathbb{Z}_n\) ?
2nd case inverse will exist for every element of Z_n\{0} 1st case inverse will exist for those elemnts whose gcd(a,n)=1
Yes, that means we are sure that few elements will not have inverses when \(n\) is composite.
yeah...
Since division is defined based on inverses, we cannot define division for arbitrary \(n\).
division operation is definied on the set \(\mathbb{Z}_n\) only when \(n\) is prime
oh and about the composite one, do you have counter example?
or will we say that since multiplicative inverse doesnot exist in Z_n for all n for that reason
there exists at least one element without an inverse when \(n\) is composite
to define the division operation on the entire set, you must have inverse for each and every element
since at least one element has no inverse when \(n\) is composite, you cannot define division operation on the set
oh got it thanks.. but in Z_p we dont have inverse of 0, so we will exclude it?
in Z_n w.r.t multiplication we also excluded 0
Oh I completely forgot about that! 0 has no inverse, so we cannot define division operation over the set \(\mathbb{Z}_n\) for any \(n\)
If you exclude 0, it is no longer the set \(\mathbb{Z}_n\)
correct
so we will say that since 0 dont have any multiplicative inverse, we cannot define division on Z_n and to define division on z_n we will have to bring restrictions: case 1) compositive: those gcd(a,n)=1 case 2) prime : exclude 0
Btw, I'm not good in abstract algebra... do let me know if im wrong.. :)
no its ok.. I too am learning
we don't need cases like composite/prime saying gcd(a,n)=1 is sufficient i guess
yeah correct
when \(n\) is a prime, we have \(\gcd(a,n)=1\) for all \(1\le a\lt n\)
gcd(a,0)=0 not equals 1
so 0 will be automatically excluded
right
so I think we are basically done with this problems.. Let me ask you one thing. I was reading Theory of Elasticity and it was written that \[e _{ij}x _{i}x _{j}=\pm k^2\]
is a qudaric surface
can you demonstrate how its a quadric surface?
sorry i may not be useful here..
ohkay.. anyways thanks.. I always think that you have knowledge in every field.:)
|dw:1447430541710:dw|
Join our real-time social learning platform and learn together with your friends!