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

<record version="7" id="923">
 <title>divisibility</title>
 <name>Divisibility</name>
 <created>2001-11-16 20:54:46</created>
 <modified>2007-09-11 13:42:55</modified>
 <type>Definition</type>
 <creator id="2727" name=""/>
 <classification>
	<category scheme="msc" code="11A51"/>
 </classification>
 <synonyms>
	<synonym concept="divisibility" alias="divides"/>
	<synonym concept="divisibility" alias="divisor"/>
	<synonym concept="divisibility" alias="factor"/>
	<synonym concept="divisibility" alias="multiple"/>
 </synonyms>
 <related>
	<object name="LeastCommonMultiple"/>
	<object name="ExampleOfGcd"/>
	<object name="TauFunction"/>
	<object name="ExactlyDivides"/>
	<object name="DivisorSumOfAnArithmeticFunction"/>
	<object name="StrictDivisibility"/>
	<object name="FundamentalTheoremOfArithmetic"/>
	<object name="NumberTheory"/>
 </related>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{graphicx}
\usepackage{xypic}</preamble>
 <content>Given integers $a$ and $b$, then we say $a$ \emph{divides} $b$ if and only if there is some $q \in \mathbb{Z}$ such that $b=qa$.

There are many other ways in common use to express this relationship:

\begin{itemize}
\item $a\mid b$ (read ``$a$ divides $b$'').
\item $b$ is divisible by $a$.
\item $a$ is a factor of $b$.
\item $a$ is a divisor of $b$.
\item $b$ is a \emph{multiple} of $a$.
\end{itemize}

The notion of divisibility can apply to other rings (e.g., polynomials).</content>
</record>
