This site is supported by donations to The OEIS Foundation.

Prime elements

From OeisWiki
Jump to navigationJump to search


This article page is a stub, please help by expanding it.


A prime element of a domain is an element p which is neither zero nor a unit divisible only by units and associates and which also satisfies the following condition: if p|ab, where a and b are also in the same domain, then either p|a or p|b, maybe both; but if neither of those holds true, then p may be irreducible but it is not prime. In fact, if the domain is not a unique factorization domain, it does not have prime elements though it may have irreducible elements.

For example, in [i] (see: Gaussian integers), we see that (1i)|(2×5) and that 21i=1+i. Though 51i=5+5i2∉[i], this does not detract from the fact that 1i is a prime element of [i].

Although 2 is irreducible in [5], it is not prime. For example, 2|((15)(1+5)),[1] but 152=1252∉[5] and 1+52=12+52∉[5] either. Note that 6 has two factorizations into irreducibles: 6=2×3=(15)(1+5).

Notes

[edit]
  1. Ian Stewart & David Tall, Algebraic Number Theory and Fermat's Last Theorem, 3rd Ed. Natick, Massachusetts: A. K. Peters (2002): 87