Proof of zero divisor existence.

shamus390
Messages
8
Reaction score
0
1. Let a != 0 and b be elements of the integers mod n. If the equation ax=b has no solution in Zn then a is a zero divisor in Zn

The Attempt at a Solution



Not sure where to start on this proof, I keep trying to find something using the properties of modular arithmetic but am coming up empty
 
Physics news on Phys.org
Hint: If ##ax = b## has no solutions, then that means the map ##\phi : Z_n \rightarrow Z_n## defined by ##\phi(x) = ax## is not surjective. Since ##Z_n## is finite, what else does that imply about ##\phi##?
 
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