Skip to main content

Section 8.1 Remainders and divisibility

The following theorem is the starting point for our studies on divisibility.

We prove existence and uniqueness separately.

Existence: Let \(q\) be the largest integer for which \(qa\leq b\text{.}\) Let \(r=b-qa\geq 0\text{.}\) Then we must also have \(r\lt a\text{,}\) since if \(r\geq a\text{,}\) then \(b-qa\geq a\text{,}\) and so \(b-(q+1)a\geq 0\text{,}\) which contradicts \(q\) being the largest integer for which \(qa\leq b\text{.}\) This shows the existence of a pair \((q,r)\) satisfying the theorem.

Uniqueness: Assume that \((q',r')\) is a pair of integers such that \(b=q'a+r'\) and \(0\leq r'\lt a\text{.}\) Then

\begin{equation*} 0=b-b=q'a+r'-qa-r = (q'-q)a+(r'-r)\text{,} \end{equation*}

and so

\begin{equation*} r'-r=(q-q')a\text{.} \end{equation*}

Since \(0\leq r,r'\lt a\text{,}\) we know \(|r-r'|\lt a\text{.}\) Thus

\begin{equation*} a>|r-r'|=|(q-q')a|=|q-q'|\cdot a\text{,} \end{equation*}

which implies that \(1>|q-q'|\text{.}\) Since \(|q-q'|\) is a nonnegative integer, it therefore follows that \(q=q'\text{.}\)

Definition 8.1.2.

For two integers \(a\) and \(b\) we say \(a\) divides \(b\) if there is an integer \(c\) so that \(b=ac\text{.}\)

Some authors will write \(a | b\) for the sentence “\(a\) divides \(b\text{.}\)” (This isn't great notation.)

So for example, \(2\) divides \(4\text{,}\) but \(2\) does not divide \(3\text{.}\)

Exercise.