Scribd
Upload
10 views2 pages

Division Algorithm

The document explains the division algorithm, emphasizing that division is repetitive subtraction and introduces the formula: Dividend = Divisor * Quotient + Remainder. It illustrates how to determine remainders when dividing by a number and its factors, providing examples and practice questions. Key points include the relationship between divisibility, factors, and remainders.

Uploaded by

manushiaaditcanada
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
10 views2 pages

Division Algorithm

The document explains the division algorithm, emphasizing that division is repetitive subtraction and introduces the formula: Dividend = Divisor * Quotient + Remainder. It illustrates how to determine remainders when dividing by a number and its factors, providing examples and practice questions. Key points include the relationship between divisibility, factors, and remainders.

Uploaded by

manushiaaditcanada
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/ 2

DIVISION ALGORITHM

I hope, by now you now have a good grip over the basic topics like Algebra and Percentages.
Even if you are not, then we are going to discuss an individual topic which is very important from
GCET point of view.

Division is nothing but repetitive subtraction. Let us suppose, if we want to distribute Rs.10, each
to a group of 30 students, then what will be the amount needed?
Yes, you are correct it is Rs.300, and this figure can be obtained by multiplying 10 with 30. But
actually this process is based on adding 10, 30 times. 10+10+10+10.........30 times.

Similarly, if I ask that from Rs.300 each student is to be given Rs. 10, then how many
students can be entertained?
Your answer will be 30 as 300/10=30; Actually, it is 300-10-10-10......many times=0; then the
answer will come as 30.

If we divide any number by another number, then either it will be fully divisible or will not be
divisible. It will be divisible only if we divide the number by any of its factor, and if the number is
generating a remainder means it was not divided by its factor.
So here I can put it as, either there will be a factor or there will be remainder.

So finally Division algorithm will be

Dividend=Divisor*Quotient+Remainder

Lets look at this particular case. If a number is divided by 100 and gives no remainder
means that the number can be written in the form of 100K and if it is divided by any of its factor like
50,25,20,10,5,4 and 2, it will also result in a zero remainder. Here one point which should also be
noted is that the maximum value of the remainder which is possible has to be 1 lesser than the
divisor.

Now if a number divided by 100 leaves 97 as the remainder, then it will be (as per the
division algorithm) 100k+97; and if we divide the same number by and of its factors, remainders can
be determined. Because out of the first part i.e. 100k, no remainder will be obtained and from the
second part i.e. 97 if divided by its factor, we can determine the remainder. So in case of
50,25,20,10,5,4 and 2 respective remainders will be 47,22,17,7,2,1 and 1. However, if we divided
this number by a number other than its factor then a remainder cannot be determined as in that
case remainder from the first part will not be known.

Here are some questions for you practice.

Q.1 When a number is divided by 48 leaves a remainder of 37, what will be the remainder if we
divided the same number by 8? Ans: 5
Q.2 When a number is divided by 236, remainder is 118, what will be the remainder when the same
number is divided by 59? Ans: 0

Q.3 If x is divided by a certain divisor, remainder is 47 and if y is divided by the same divisor
remainder is 28; but when sum of both numbers is divided by the same divisor, remainder is 16, Find
the Divisor. Ans: 59

You might also like