Zero divisor: Difference between revisions
No edit summary |
mNo edit summary |
||
| (One intermediate revision by one other user not shown) | |||
| Line 2: | Line 2: | ||
For example, in the ring of [[integer]]s taken [[modular arithmetic | modulo]] 6, 2 is a zero divisor because <math>2 \cdot 3 \equiv 0 \pmod 6</math>. However, 5 is ''not'' a zero divisor mod 6 because the only solution to the equation <math>5x \equiv 0 \pmod 6</math> is <math>x \equiv 0 \pmod 6</math>. | For example, in the ring of [[integer]]s taken [[modular arithmetic | modulo]] 6, 2 is a zero divisor because <math>2 \cdot 3 \equiv 0 \pmod 6</math>. However, 5 is ''not'' a zero divisor mod 6 because the only solution to the equation <math>5x \equiv 0 \pmod 6</math> is <math>x \equiv 0 \pmod 6</math>. | ||
1 is not a zero divisor in any ring. | |||
A ring with no zero divisors is called an [[integral domain]]. | A ring with no zero divisors is called an [[integral domain]]. | ||
| Line 10: | Line 12: | ||
{{stub}} | {{stub}} | ||
[[Category:Ring theory]] | |||
Latest revision as of 16:25, 5 September 2008
In a ring 
, a nonzero element 
is said to be a zero divisor if there exists a nonzero 
such that 
.
For example, in the ring of integers taken modulo 6, 2 is a zero divisor because 
. However, 5 is not a zero divisor mod 6 because the only solution to the equation 
is 
.
1 is not a zero divisor in any ring.
A ring with no zero divisors is called an integral domain.
See also
This article is a stub. Help us out by expanding it.
