Scribd
Upload
37 views1 page

Module 3 Division Algorithm

The document explains the Division Algorithm, which states that for any natural numbers a and b (with b ≠ 0), there exist unique integers q (quotient) and r (remainder) such that a = bq + r, where 0 ≤ r < |b|. It provides examples to illustrate how to find the number, divisor, and quotient using this algorithm. The document emphasizes the importance of the Division Algorithm in number theory and related algorithms.

Uploaded by

Angel Lyca Ualat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
37 views1 page

Module 3 Division Algorithm

The document explains the Division Algorithm, which states that for any natural numbers a and b (with b ≠ 0), there exist unique integers q (quotient) and r (remainder) such that a = bq + r, where 0 ≤ r < |b|. It provides examples to illustrate how to find the number, divisor, and quotient using this algorithm. The document emphasizes the importance of the Division Algorithm in number theory and related algorithms.

Uploaded by

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

MODULE 3: DIVISION ALGORITHM 1.

When the number is divided by 7, the quotient is 21


and the remainder is 5. Find the number.
DIVISION ALGORITHM
Given: 𝑎 = ?
In general, it is not always possible to divide one natural
number by another and get a natural number as a result. 𝑏=7
The procedure of division with remainder is available as a
substitute: for any natural numbers 𝑎 and 𝑏 with 𝑏 ≠ 0 we 𝑞 = 21
can find natural numbers 𝑞 and 𝑟 such that 𝑟=5
𝑎 = 𝑏𝑞 + 𝑟 and 0 ≤ 𝑟 <∣ 𝑏 ∣ SOLUTION:
The number 𝑞 is called the quotient and 𝑟 is called the 𝑎 = 𝑏𝑞 + 𝑟
remainder of the division 𝑎 by 𝑏. The numbers 𝑞 and 𝑟 are
uniquely determined by 𝑎 and 𝑏. This, the Division 𝑎 = (7)(21) + 5
Algorithm, is key to several other properties (divisibility), 𝑎 = 147 + 5
algorithms (such as Euclidean algorithm), and ideas in
number theory. 𝑎 = 152
Theorem: Let 𝑎 and 𝑏 be integers with 𝑏 ≠ 0. Then there 2. A number is divided by a certain divisor. The quotient
exists integers q and r such that is 6, the remainder is 2, and the dividend is 38. Find the
divisor.
𝑎 = 𝑏𝑞 + 𝑟 and 0 ≤ 𝑟 <∣ 𝑏 ∣
Given: 𝑎 = 38
Also, the integers q and r and unique.
𝑏= ?
The integer
𝑞=6
• q is called the quotient
𝑟=2
• r is called the remainder
SOLUTION:
• b is called the divisor
𝑎 = 𝑏𝑞 + 𝑟
• a is called the dividend
38 = 𝑏(6) + 2
ILLUSTRATION
38 = 6𝑏 + 2
Let 𝑎 = 4461 and 𝑏=16, then 𝑞 = 278, 𝑟 = 13
38 − 2 = 6𝑏
36 = 6𝑏
36 6𝑏
=
6 6
6=𝑏
3. A number is divisible by 11. The remainder is 4 and the
dividend is 81. Find the quotient.
Given: 𝑎 = 81
𝑏 = 11
𝑎 = 𝑏𝑞 + 𝑟 𝑞= ?
4461 = (16)(278) + 13 𝑟=4
4461 = 4448 + 13 SOLUTION:

4461 = 4461 a = bq + r
81 = 11q + 4
81 − 4 = 11q
77 = 11q
77 11q
=
11 11
7=q

You might also like