Beruflich Dokumente
Kultur Dokumente
Division Theorem
From ProofWiki
Math problems?
Let us help you It is free
This article was Featured Proof between 12 October 2008 and 19 October 2008.
Contents
1 Theorem
2 Proof 1
3 Proof 2
4 Informal Proof
4.1 Existence
4.2 Uniqueness
5 Also known as
6 Sources
Theorem
For every pair of integers a, b where b
0,
= qb + r
and 0
r < |b| :
Proof 1
From Division Theorem: Positive Divisor:
a, b Z, b > 0 : !q, r Z : a = qb + r, 0 r < b
It remains to show that the result also holds for negative values of b.
Let b
< 0.
Consider:
|b| = b > 0
|b|
https://proofwiki.org/wiki/Division_Theorem
|b| > 0
1/4
11/11/2015
> 0.
~ ~
such that:
~
~
~
a = q |b| + r , 0 r < |b|
Since |b|
= b :
~
~
~
~
a = q (b) + (r ) = (q ) b + r
Taking:
~
~
q = q , r = r
the existence has been proved of integers q and r that satisfy the requirements.
The proof that they are unique is the same as that for the proof for positive b, but with |b| replacing b.
Proof 2
Consider the set of integer multiples x
|b|
M := {k Z : x Z : k = x |b| , k a}
We have that:
|a| |b| |a| a
and so M
From Integers Bounded Above has Greatest Element, M has a greatest element h
Then h
|b| a
|b| .
and so:
a = h |b| + r
where r 0 .
On the other hand:
(h + 1) |b| = h |b| + |b| > h |b|
So:
(h + 1) |b| > a
and:
h |b| + |b| > h |b| + r
Thus:
r b
Setting:
q = h
when b > 0
when b < 0
q = h
it follows that:
h |b|
https://proofwiki.org/wiki/Division_Theorem
= qb
2/4
11/11/2015
and so:
a = qb + r
as required.
Informal Proof
Existence
Consider the progression:
, a 3b, a 2b, a b, a, a + b, a + 2b, a + 3b,
Z.
must be in the interval [0, b) because otherwise r b would be smaller than r and a non-negative element in the
progression.
r
Uniqueness
Suppose we have another pair q0 and r0 such that a
Then bq + r = bq0
+ r0
r < b
Hence, r r0
So now r r0
and 0
= 0
, with 0
r0 < b
.
= b (q0 q)
r0 < b
= bq0 + r0
r = r0
= 0 = b (q0 q)
, and so b (r r0 ) .
, we have that b
< r r0 < b
.
which implies that q = q0 .
Also known as
Otherwise known as the Quotient Theorem, or (more specifically) the Quotient-Remainder Theorem (as there are several
other "quotient theorems" around).
Some sources call this the division algorithm but it is preferable not to offer up a possible source of confusion between this and
the Euclidean Algorithm to which it is closely related.
It is also known by some as Euclid's Division Lemma, and by others as the Euclidean Division Property.
Sources
B. Hartley and T.O. Hawkes: Rings, Modules and Linear Algebra (1970)... (previous)... (next): 2.3: Some properties
https://proofwiki.org/wiki/Division_Theorem
3/4
11/11/2015
https://proofwiki.org/wiki/Division_Theorem
4/4