Multiplication Properties of Equivalence Classes

jcfaul01
Messages
2
Reaction score
0

Homework Statement



Prove or disprove and salvage if possible: for [a], ∈ Zn for a positive integer n, if [a]·=[0], then either [a]=[0] or =[0].

The Attempt at a Solution



I've managed to disprove the statement:
Let n=6,[a]=3,and=[4]. The[a]·=[ab]=[3·4]=[12]. Since12≡0(modn), 12 ∈ [0] so[12] = [0]. Thus [3] · [4] = [0] and this statement is false.

However, my problem is with salvaging it. I've been able to come up with what I believe to be the correct statement:

For [a], ∈ Zn for a positive integer n, if [a] · = [0], then ab ≡ 0 (mod n).

But I have no idea how to prove it, I don't even know where to start. I would really appreciate any help on this,

thanks.
 
Physics news on Phys.org
What you have, [m][n]= 0 implies mn= 0 (mod n) is just the definition of [m][n]= 0.

Let n be a prime integer, then ...
 
Thanks! I think I've got it now!
 
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