Euclid's Division Lemma

IMPORTANT

Euclid's Division Lemma: Overview

This topic introduces the concept of Euclid's Division Lemma, which is used to compute the highest common factor of two given positive integers. We will also learn that the remainder theorem is similar to Euclid's Division Lemma.

Important Questions on Euclid's Division Lemma

MEDIUM
IMPORTANT

Let p and q be two natural numbers such that p>q. When p is divided by  q, the remainder is r.

i) r cannot be p-q

ii) r can either be q or p-q

iii) r is definitely less than q

Which of the above statements is/are true?

HARD
IMPORTANT

The HCF of k and 93 is 31, where k is a natural number. Which of these can be true for some values of k?

(i) k is a multiple of 31

(ii) k is a multiple of 93

(iii) k is an even number.

(iv) k is an odd number.

MEDIUM
IMPORTANT

If a natural number 'a' is divided by 7, the remainder is 5. If a natural number 'b' is divided by 7, the remainder is 3. The remainder is 'r' if a+b is divided by 7. Find the value of 3r+54.

MEDIUM
IMPORTANT

Find the HCF of the following

3,12

_____

MEDIUM
IMPORTANT

Find the L.C.M of 8 and 24

MEDIUM
IMPORTANT

Atul exercises every 16 days and Arjun exercises every 10 days. Atul and Arjun both exercised today. How many days will it be until they exercise together again.

MEDIUM
IMPORTANT

If the H.C.F of 96,404=4, then find the L.C.M of 96,404

MEDIUM
IMPORTANT

Find the L.C.M of 336 and 54 using prime factorisation method

MEDIUM
IMPORTANT

Find the L.C.M of 6,72, 120 using prime factorisation method.

EASY
IMPORTANT

Identify the natural numbers among the given series of numbers: -3,-10,0,5,8,4.6,98,2.9

EASY
IMPORTANT

Are the natural numbers positive integers? Justify the answer.

EASY
IMPORTANT

Natural numbers are whole numbers. Justify the answer.

EASY
IMPORTANT

Negative numbers are natural numbers.

MEDIUM
IMPORTANT

0 is a natural number

EASY
IMPORTANT

Find the HCF of 250 and 75 using Euclid's Division Lemma

EASY
IMPORTANT

Find HCF of 135 and 225 (use Euclid's division Algorithm).

EASY
IMPORTANT

17=6×2+5 is compared with Euclid's Division lemma a=bq+r, then which number is representing the remainder?

MEDIUM
IMPORTANT

Find the HCF by using long division method:
30,90,120

MEDIUM
IMPORTANT

Find the HCF by using long division method:
175,105,70.

MEDIUM
IMPORTANT

Find the HCF by using long division method:
240,510