Ask your own question, for FREE!
Mathematics 16 Online
OpenStudy (jango_in_dtown):

Abstract algebra

OpenStudy (jango_in_dtown):

Show that one cannot define division in Z_n for any arbitrary positive integer n. When division is possible in Z_n ?

OpenStudy (jango_in_dtown):

@Kainui

OpenStudy (jango_in_dtown):

@pooja195

OpenStudy (jango_in_dtown):

@ganeshie8

OpenStudy (jango_in_dtown):

@lochana

ganeshie8 (ganeshie8):

you can divide by \(a\) only if the inverse exists for \(a\) under modulus \(n\)

OpenStudy (jango_in_dtown):

Its \[Z_n\]

ganeshie8 (ganeshie8):

\(\mathbb{Z}_n = \{0,1,2,\ldots, n-1\}\) is the set of least nonnegative residues under modulus \(n\) right ?

OpenStudy (jango_in_dtown):

yeah correct

ganeshie8 (ganeshie8):

\(\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\)

OpenStudy (jango_in_dtown):

yeah......

ganeshie8 (ganeshie8):

Next, how do you find the inverse of \(a\) under modulus \(n\) ?

OpenStudy (jango_in_dtown):

\[[1/2]=[0]\]

OpenStudy (jango_in_dtown):

???

OpenStudy (jango_in_dtown):

lets take Z_6 here

ganeshie8 (ganeshie8):

you get the multiplicative inverse of \(a\) by solving : \[ax\equiv 1\pmod{n}\] yes ?

ganeshie8 (ganeshie8):

how good are you with congruence s?

OpenStudy (jango_in_dtown):

I know the meanings and few theorems.

ganeshie8 (ganeshie8):

that should do :)

OpenStudy (jango_in_dtown):

ok..:)

ganeshie8 (ganeshie8):

lets take \(\mathbb{Z}_6\) maybe, just for working an example

OpenStudy (jango_in_dtown):

ok..:)

ganeshie8 (ganeshie8):

let \(a=5\) whats the inverse of \(a\) in \(\mathbb{Z}_6\) ?

OpenStudy (jango_in_dtown):

w.r.t multi[lication ?? or division?

ganeshie8 (ganeshie8):

i never heard of an inverse with respect to division before

ganeshie8 (ganeshie8):

w.r.t multiplication, yes :)

OpenStudy (jango_in_dtown):

its 5 itself

ganeshie8 (ganeshie8):

Yes, what about the multiplicative inverse of 4 ?

OpenStudy (jango_in_dtown):

4 dont have any multiplicative inverse since the multiplicative invers exists iff gcd(a,n)=1 where a belongs to Zn

ganeshie8 (ganeshie8):

so you do know the criterion for existence of inverses

OpenStudy (jango_in_dtown):

yeah, for multiplication i know. but the question is asked about division

ganeshie8 (ganeshie8):

we define division using multiplication : \(\dfrac{b}{a} = ba^{-1}\)

OpenStudy (jango_in_dtown):

ohkay,,,:)

ganeshie8 (ganeshie8):

let me ask you a question

ganeshie8 (ganeshie8):

consider two cases : 1) \(n\) is composite, 2) \(n\) is prime

ganeshie8 (ganeshie8):

For each case, what can you say about the existence of inverse for each of the elements in \(\mathbb{Z}_n\) ?

OpenStudy (jango_in_dtown):

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

ganeshie8 (ganeshie8):

Yes, that means we are sure that few elements will not have inverses when \(n\) is composite.

OpenStudy (jango_in_dtown):

yeah...

ganeshie8 (ganeshie8):

Since division is defined based on inverses, we cannot define division for arbitrary \(n\).

ganeshie8 (ganeshie8):

division operation is definied on the set \(\mathbb{Z}_n\) only when \(n\) is prime

OpenStudy (jango_in_dtown):

oh and about the composite one, do you have counter example?

OpenStudy (jango_in_dtown):

or will we say that since multiplicative inverse doesnot exist in Z_n for all n for that reason

ganeshie8 (ganeshie8):

there exists at least one element without an inverse when \(n\) is composite

ganeshie8 (ganeshie8):

to define the division operation on the entire set, you must have inverse for each and every element

ganeshie8 (ganeshie8):

since at least one element has no inverse when \(n\) is composite, you cannot define division operation on the set

OpenStudy (jango_in_dtown):

oh got it thanks.. but in Z_p we dont have inverse of 0, so we will exclude it?

OpenStudy (jango_in_dtown):

in Z_n w.r.t multiplication we also excluded 0

ganeshie8 (ganeshie8):

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\)

ganeshie8 (ganeshie8):

If you exclude 0, it is no longer the set \(\mathbb{Z}_n\)

OpenStudy (jango_in_dtown):

correct

OpenStudy (jango_in_dtown):

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

ganeshie8 (ganeshie8):

Btw, I'm not good in abstract algebra... do let me know if im wrong.. :)

OpenStudy (jango_in_dtown):

no its ok.. I too am learning

ganeshie8 (ganeshie8):

we don't need cases like composite/prime saying gcd(a,n)=1 is sufficient i guess

OpenStudy (jango_in_dtown):

yeah correct

ganeshie8 (ganeshie8):

when \(n\) is a prime, we have \(\gcd(a,n)=1\) for all \(1\le a\lt n\)

OpenStudy (jango_in_dtown):

gcd(a,0)=0 not equals 1

OpenStudy (jango_in_dtown):

so 0 will be automatically excluded

ganeshie8 (ganeshie8):

right

OpenStudy (jango_in_dtown):

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\]

OpenStudy (jango_in_dtown):

is a qudaric surface

OpenStudy (jango_in_dtown):

can you demonstrate how its a quadric surface?

ganeshie8 (ganeshie8):

sorry i may not be useful here..

OpenStudy (jango_in_dtown):

ohkay.. anyways thanks.. I always think that you have knowledge in every field.:)

OpenStudy (jango_in_dtown):

|dw:1447430541710:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!