Scribd
Upload
15 views7 pages

Division

Hassan Zahid will be giving a presentation on the division algorithm. The division algorithm, also known as the Euclidean algorithm, takes two integers as input - the numerator and denominator - and computes their quotient and remainder. There are two main types of division algorithms: slow division, which produces one digit of the quotient per iteration, and fast division, which starts with an approximation and produces multiple digits of the quotient each iteration. The presentation will prove the division algorithm using the well ordering property and showing the quotient and remainder are unique.

Uploaded by

hassan6936t
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
15 views7 pages

Division

Hassan Zahid will be giving a presentation on the division algorithm. The division algorithm, also known as the Euclidean algorithm, takes two integers as input - the numerator and denominator - and computes their quotient and remainder. There are two main types of division algorithms: slow division, which produces one digit of the quotient per iteration, and fast division, which starts with an approximation and produces multiple digits of the quotient each iteration. The presentation will prove the division algorithm using the well ordering property and showing the quotient and remainder are unique.

Uploaded by

hassan6936t
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 7

HASSAN ZAHID

54481

Click icon to add picture

DISCRETE
STUCTURES
PRESENTATION
Click icon to add picture
DIVISION
ALGORITHM
Henry Briggs
DIVISION ALGORITHM OR EUCLIDE
THEOREM
 A division algorithm is an algorithm which, given two integers N and D (respectively the
numerator and the denominator), computes their quotient and/or remainder, the result of
Euclidean division. Some are applied by hand, while others are employed by digital
circuit designs and software.
 Division algorithms fall into two main categories: slow division and fast division. Slow
division algorithms produce one digit of the final quotient per iteration. Examples of
slow division include restoring, non-performing restoring, non-restoring, and SRT
division. Fast division methods start with a close approximation to the final quotient and
produce twice as many digits of the final quotient on each iteration. Newton–Raphson
and Goldschmidt algorithms fall into this category.
PROOF
 if a and b are integers such that b>0, then there exist unique integer q and r such
that a= bq +r where 0<=r<b
Consider that A = {a – bx ≥ 0: x ∈ ℤ} Note that A is non-empty.
If 0 ∈ A, then by well ordering property 0 is least element of A.
If 0 ∉ A, then A be the set that must have least element.
Let r ∈ A be the least element.
Then, r = a – bx where r ≥ 0 Replace x by q,
we have r = a – bq where r ≥ 0 ⇒a = bq + r where r ≥ 0… (a)
Now, we have to prove r < b.
For this, we suppose on contrary
that r ≥ b ⇒ r – b ≥ 0 ⇒ r – b ∈ A But r – b < r
This is contradiction to our supposition.
So our supposition is wrong and therefore r < b … (b) Combining (a) & (b), we have a = bq + r where 0 ≤ r <
b.
Consider that
A = {a – bx ≥ 0: x ∈ ℤ}
Note that A is non-empty.
If 0 ∈ A, then by well ordering property 0 is least element of A.
If 0 ∉ A, then A be the set that must have least element.
Let r ∈ A be the least element. Then,
r = a – bx where r ≥ 0
Replace x by q, we have
r = a – bq where r ≥ 0
⇒a = bq + r where r ≥ 0..... (a)
Now, we have to prove r < b.
For this, we suppose on contrary that
r ≥ b ⇒ r – b ≥ 0 ⇒ r – b ∈A
But r – b < r
This is contradiction to our supposition.
So our supposition is wrong and therefore
r < b .... (b)
Combining (a) & (b), we have
a = bq + r where 0 ≤ r < b.
b|(q - q1)| < b ⇒ |q - q1| < 1 ⇒ |q - q1| = 0 ⇒ q = q1
Using q = q1 in equation (1),
we have r = r₁
Hence q = q₁ and r = r₁ implies that both q and r are unique.
This completes the proof of division algorithm.

You might also like