Euclid's Division Algorithm
Trending Questions
Find the smallest digit number divisible of and .
Krishnan bought chocolates for his brothers. When he grouped the chocolates in groups of 4, 1 chocolate was left, if grouped in 5, 4 chocolates were left, if grouped in 6, 1 chocolate was left and if grouped in 7, no chocolate was left ungrouped. If the total number of chocolates bought was less than 50, find the number of chocolates Krishnan bought.
49
35
45
29
If HCF (1008, 20) = HCF (20, a) = HCF(a, b) where 1008=20×q+aand 20=a×m+b.
Here, q, a, m and b being positive integers satisfying Euclid’s division lemma. What could be the values of a and b?
8, 4
10, 4
20, 8
24, 8
The difference of two numbers is 1365. On dividing the larger number by the smaller, we get 6 as quotient and 15 as remainder. What is the smaller number ?
270
240
295
360
2361 = ( 784 × Q ) + R
Find the value of Q and R.
7, 366
18, 758
16, 758
758, 16
Prove that if a positive number is of the form , then it is of the form for some integer, but not conversely
- a prime number
- divisible by 24
- divisible by 16
- divisible by 20
The difference of two numbers is 1365. On dividing the larger number by the smaller, we get 6 as quotient and 15 as remainder. What is the smaller number ?
295
270
240
360
If the HCF of and is expressible in the form , then the value of is
If in a class there are girls and boys, then
Strength : Number of boys ______
(i) 16 and 176