Word Problems Based on Division Algorithm :
Here we are going to see, word problems based on division algorithm.
(1) Find all positive integers, when divided by 3 leaves remainder 2. Solution
(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
(3) Prove that the product of two consecutive positive integers is divisible by 2. Solution
(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
(5) Prove that square of any integer leaves the remainder either 0 or 1 when divided by 4. Solution
(6) Use Euclid’s Division Algorithm to find the Highest Common Factor (HCF) of
(i) 340 and 412
(ii) 867 and 255
(iii) 10224 and 9648
(iv) 84, 90 and 120 Solution
(7) Find the largest number which divides 1230 and 1926 leaving remainder 12 in each case. Solution
(8) If d is the Highest Common Factor of 32 and 60, find x and y satisfying d = 32x + 60y . Solution
(9) A positive integer when divided by 88 gives the remainder 61. What will be the remainder when the same number is divided by 11? Solution
(10) Prove that two consecutive positive integers are always coprime. Solution
After having gone through the stuff given above, we hope that the students would have understood, "Euclid Division Algorithm Questions".
Apart from the stuff given in this section "Euclid Division Algorithm Questions", if you need any other stuff in math, please use our google custom search here.
You can also visit the following web pages on different stuff in math.
APTITUDE TESTS ONLINE
ACT MATH ONLINE TEST
TRANSFORMATIONS OF FUNCTIONS
ORDER OF OPERATIONS
Analytical geometry calculators
MATH FOR KIDS
Word problems on linear equations
Trigonometry word problems
Word problems on mixed fractrions
Ratio and proportion shortcuts
Converting repeating decimals in to fractions