Division Algorithm
The division algorithm allows us to classify a positive integer according to its remainder. For example, every integer is either even or odd (not both); that is, every integer has a remainder of 0 or 1 when divided by 2. Although not truly an algorithm in the traditional sense, the division algorithm allows us to prove statements about the integers by considering only a finite number of cases.
Proposition (Division Algorithm) If
and
are integers such that
then there are unique integers
and
such that
with
The integers
and
are called the quotient and the remainder in the division of
by
Proof. Consider the set
The set
is nonempty because
since
By the Well Ordering Principle
has a least positive integer, say
Thus, there exists an integer
such that
and so
with
It follows that
because otherwise,
which contradicts the choice of
as the least positive integer in
![division algorithm _gr_28.gif]](pages/division-algorithm/Images/division-algorithm_gr_28.gif) To prove that
and
are unique, assume that we have two equations
and
with
and
By subtracting the second of the equations from the first we have,
Thus
divides
and since
and
we have
Thus
can divide
only if
Therefore,
and also
by the equations involving
and
Whence the quotient and remainder are unique.
One of the advantages of the division algorithm is that it allows us to prove statements about the integers by considering only a finite number of cases.
Example (Division Algorithm) Show that the expression
is an integer for any positive integer
![division algorithm _gr_50.gif]](pages/division-algorithm/Images/division-algorithm_gr_50.gif)
Solution. Equivalently, we need to show that
is of the form
for some
for any positive integer
By the division algorithm,
has exactly one of the forms
or
If
for some
then
![division algorithm _gr_61.gif]](pages/division-algorithm/Images/division-algorithm_gr_61.gif)
is an integer. If
for some
then
![division algorithm _gr_64.gif]](pages/division-algorithm/Images/division-algorithm_gr_64.gif)
is an integer. Finally, if
is of the form
then we have
![division algorithm _gr_67.gif]](pages/division-algorithm/Images/division-algorithm_gr_67.gif) which is an integer. Therefore, in all cases,
is an integer for any positive integer
Example (Division Algorithm) Show that the product of any three consecutive integers is divisible by
Solution. Let
be an integer. We need to show that
is of the form
The division algorithm yields that
is either even or odd (not both). In either case,
must be even. The integer
is also divisible by 3, since one of
or
is of the form
Since
is even and is divisible by 3, it must be divisible by 6.
Proposition (Division Algorithm - Alternate Form) If
and
are integers such that
then there are unique integers
and
such that
with
![division algorithm _gr_90.gif]](pages/division-algorithm/Images/division-algorithm_gr_90.gif)
Proof. Suppose we are given integers
and
If
then we have the division algorithm which stated there exists unique
and
such that
with
and so in fact we have
with
If
then the statement is trivially true. The only other case is to assume
So we apply the division algorithm with
and
obtaining unique integers
and
such that
with
Let
and then
with
This
and
is unique for this
and
because otherwise would contradict the division algorithm.
Cite this as: Division Algorithm Published by Library of Math -- Online math organized by subject into topics.
Written by Smith, David A.
http://www.libraryofmath.com/division-algorithm.html
|
|