<?xml version="1.0" encoding="UTF-8"?>

<record version="6" id="2929">
 <title>composite number</title>
 <name>CompositeNumber</name>
 <created>2002-05-23 00:16:16</created>
 <modified>2004-09-10 10:27:42</modified>
 <type>Definition</type>
 <creator id="2727" name="mathcam"/>
 <author id="2727" name="mathcam"/>
 <author id="2" name="akrowne"/>
 <classification>
	<category scheme="msc" code="11A41"/>
 </classification>
 <synonyms>
	<synonym concept="composite number" alias="composite"/>
 </synonyms>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}

%\usepackage{psfrag}
%\usepackage{graphicx}
%\usepackage{xypic}</preamble>
 <content>A \emph{composite number} is a positive integer which is not prime and not equal to 1.  That is, $n$ is composite if $n = ab$, with $a$ and $b$ natural numbers both not equal to 1.

\paragraph{Examples.}

\begin{itemize}

\item 1 is not composite (and also not prime), by definition.

\item 2 is not composite, as it is prime.

\item 15 is composite, since $15 = 3\cdot 5$.

\item 93555 is composite, since $93555 = 3^5\cdot 5 \cdot 7 \cdot 11$.

\item 52223 is not composite, since it is prime.

\end{itemize}

More generally, we can define compositeness any time there is an ambient notion of an irreducible element. In an integral domain, for example, an element is said to be \emph{composite} if it neither zero, a unit, nor irreducible.</content>
</record>
