WORD PROBLEMS BASED ON DIVISION ALGORITHM

About "Word Problems Based on Division Algorithm"

Word Problems Based on Division Algorithm :

Here we are going to see, word problems based on division algorithm.

Division Algorithm

Let a and b (a > b) be any two positive integers. Then, there exist unique integers q and r such that

a = bq + r, 0 ≤ r < b

Here a = divident , b = divisor, r = remainder and q = quotient

Note :

  • The remainder is always less than the divisor.
  • If r = 0 then a = bq so b divides a. 
  • Similarly, if b divides a then a = bq

Question 1 :

Find all positive integers, when divided by 3 leaves remainder 2.

Solution :

By using the division algorithm, we may easily get the answer

a = bq + r

To get the 1st number, let q = 0, r = 2 (given) and b = 3 (given)

a = 3(0) + 2

a  = 2

To get the 2nd number, let q = 1, r = 2 (given) and b = 3 (given)

a = 3(1) + 2

a  = 5

To get the 3rd number, let q = 2, r = 2 (given) and b = 3 (given)

a = 3(2) + 2

a  = 8

The next number will be 3 more than the preceding number.

2, 5, 8, 11, 14, ............

Question 2 :

A man has 532 flower pots. He wants to arrange them in rows such that each row contains 21 flower pots. Find the number of completed rows and how many flower pots are left over.

Solution :

Total number of flower pots  =  532

Number of flower pots in each row  =  21

Now, we have to find how many groups of 21 in 532. So, we use the concept division.

We may arrange the flower pots in 25 rows with each row consists of 21 pots.

The remaining number of flower pots  =  5.

Question 3 :

Prove that the product of two consecutive positive integers is divisible by 2.

Solution :

Let "x" be the positive integer, the consecutive number be "x + 1"

Note :

When a positive integer is divided by 2 the remainder is either 0 or 1. So, any positive integer will of the form 2k, 2k+1 for some integer k.

We may prove this in two cases.

Case 1 :

If x = even number  =  2k

product of two numbers  =  x (x + 1)

  =  2k(2k + 1)

Since the whole number is a multiple of 2, it is divisible by 2.

Case 2 :

If x = odd number  =  2k + 1

product of two numbers  =  x (x + 1)

  =  (2k + 1)(2k + 1 + 1)

=  (2k + 1)(2k + 2)

=  2 (k + 1)(2k + 1)

So, the product is divisible by 2.

Hence the product of two consecutive number is divisible by 2.

Question 4 :

When the positive integers a, b and c are divided by 13, the respective remainders are 9,7 and 10. Show that a+b+c is divisible by 13.

Solution :

divided = divisor x quotient + remainder

a  =  13 q1 + 9  ----(1)

b  =  13 q2 + 7----(2)

c  =  13 q3 + 10----(3)

(1) + (2) + (3)

 a + b + c  =  13q1 + 9 + 13q2 + 7 + 13q3 + 10

 a + b + c  =  13q1 + 13q2 + 13q3 + 26

 a + b + c  =  13(q1 + q2 + q3) + 13(2)

 a + b + c  =  13[(q1 + q2 + q3) + 2]

Hence a + b + c is divisible by 13.

After having gone through the stuff given above, we hope that the students would have understood, "Word Problems Based on Division Algorithm". 

Apart from the stuff given in this section "Word Problems Based on Division Algorithm"if you need any other stuff in math, please use our google custom search here.

HTML Comment Box is loading comments...