MHB Find all the zero divisors in a ring

  • Thread starter Thread starter evinda
  • Start date Start date
  • Tags Tags
    Ring Zero
evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hello! :D
I am given the following exercise:Find all the zero divisors in the ring $\mathbb{Z}_{20}$.
For each zero divisor $[a]$,find an element $ \neq [0]$ such that $[a]=[0]$.
That's what I did..Could you tell me if it is right??
Zero divisors at the ring $\mathbb{Z}_{20}$: $\{ [2], [4], [5], [6], [8], [10], [12], [14], [15], [16], [18]\}$
The couples are:
$([2],[10]),([10],[2])$
$([4],[5]),([5],[4])$
$([4],[10]),([10],[4])$
$([4],[15]),([15],[4])$
$([5],[8]),([8],[5])$
$([5],[12]),([12],[5])$
$([5],[16]),([16],[5])$
$([6],[10]),([10],[6])$
$([8],[10]),([10],[8])$
$([8],[15]),([15],[8])$
$([10],[12]),([12],[10])$
$([10],[14]),([14],[10])$
$([10],[16]),([16],[10])$
$([10],[18]),([18],[10])$
$([12],[15]),([15],[12])$
$([14],[15]),([15],[14])$
$([15],[16]),([16],[15])$
 
Physics news on Phys.org
evinda said:
Hello! :D
I am given the following exercise:Find all the zero divisors in the ring $\mathbb{Z}_{20}$.
For each zero divisor $[a]$,find an element $ \neq [0]$ such that $[a]=[0]$.
That's what I did..Could you tell me if it is right??
Zero divisors at the ring $\mathbb{Z}_{20}$: $\{ [2], [4], [5], [6], [8], [10], [12], [14], [15], [16], [18]\}$
The couples are:
$([2],[10]),([10],[2])$
$([4],[5]),([5],[4])$
$([4],[10]),([10],[4])$
$([4],[15]),([15],[4])$
$([5],[8]),([8],[5])$
$([5],[12]),([12],[5])$
$([5],[16]),([16],[5])$
$([6],[10]),([10],[6])$
$([8],[10]),([10],[8])$
$([8],[15]),([15],[8])$
$([10],[12]),([12],[10])$
$([10],[14]),([14],[10])$
$([10],[16]),([16],[10])$
$([10],[18]),([18],[10])$
$([12],[15]),([15],[12])$
$([14],[15]),([15],[14])$
$([15],[16]),([16],[15])$


Yep. It is right! (Cool)
 
I like Serena said:
Yep. It is right! (Cool)

Great!Thanks a lot! (Giggle)
 
In fact, it is not hard to see that in $\Bbb Z_{20}$ we have:

$[k]$ is a zero divisor if and only if $\text{gcd}(k,20) > 1$.

We also have the following fact (which is not true for rings in general, but IS true for cyclic rings):

$[k]$ is a zero divisor, or $[k]$ is a unit, and never both.

This turns out to be very useful when examining properties of integers in general (often, we "reduce mod $n$" and then "lift" what we have learned in $\Bbb Z_n$ to $\Bbb Z$).
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...

Similar threads

Back
Top