$CATEGORY: Maths - TicTacLearn/1. Real Numbers/1. Real Numbers--Euclid's Division Lemma

//Multiple Choice

The Euclid's Division Lemma which is one of the fundamental theorems was proposed by {
= Greek Mathematician
~ German Mathematician
~ Italian Mathematician
~ Dutch Mathematician
}

The HCF of  3814 and 2562 based on Euclid’s Division Lemma Theorem is {
= 2
~ 1
~ 4
~ None of the above
}

The HCF OF 78 and 980 {
~ 1
~ 4
= 2
~ None of the above
}

When 315 is divided by 17 using Euclid’s Division Algorithm, the quotient and remainder are {
= quotient is 18 and remainder is 9
~ quotient is 15 and remainder is 1
~ quotient is 63 and remainder is 1
~ None of the above
}

When 73 is divided by 9 using Euclid’s Division Algorithm, the quotient and remainder are {
~ quotient is 9 and the remainder is 1
= quotient is 8 and the remainder is 1
~ quotient is 6 and the remainder is 1
~ None of the above
}

//True or False

Euclid's lemma is used to calculate the HCF of large numbers. {T}

The remainder is always less than the divisor. {T}

When you divide one integer by another non-zero integer, you are left with a quotient and a remainder. {T}

The Euclid's Division Lemma can also be expressed as Dividend \= (Divisor×quotient)+ Remainder {T}

As per Euclid’s Division Lemma theorem, any positive integer a can be divided by another positive integer b, with a unique quotient q and remainder r. {T}

//Numericals

An Army contingent of 616 members march behind an army band of 32 members in a parade. Now, a couple of groups are said to march in a similar number of columns. What is the maximum number of columns in which they can march? {
~ 6
~ 7
= 8
~ None of the above
}

A fruit seller has 420 mangoes and 130 apples. He wants to stack them so that each stack has the same number, and they cover the minor area of the tray. What is the number of fruits that can be placed in each stack to cover the least area of the tray? {
= 10
~ 20
~ 30
~ None of the above
}

//Fill in the blanks

___ is the HCF of 418 and 33 is {
~ 7
~ 9
= 11
~ None of the above
}

_____ is the HCF of 210 and 55 using Euclid’s division algorithm. {
= 5
~ 7
~ 9
~ None of the above
}

_____ is the HCF 135 and 225 using Euclid’s division algorithm. {
~ 65
~ 55
= 45
~ None of the above
}

//Match the following

Match the following items from Column A with their correct corresponding options from Column B\:
{
=HCF of 220 and 40 using Euclid’s Lemma -> 20
=HCF of 78 and 980 -> 2
=HCF of 36, 96 and 120 -> 12
=HCF of 50 and 70 -> 10
}



//******** END **********