Practice30 Create account

Using Euclid's algorithm, HCF(a, b) = HCF(b, r) where a = bq + r. If HCF(1620, 1725) is computed, what is its value?

Class 10Euclid's Division LemmaNumber Systems

A16
B14
C30
D15

Step-by-Step Solution

1725 =

1620 \times 1 + 105

;

1620 = 105 \times 15 + 45

;

105 = 45 \times 2 + 15

;

45 = 15 \times 3 + 0

. HCF = 15.

Answer: D) 15

Master this chapter in 30 minutes a day.

Don't just memorise the answer — build a daily practice habit.

Practice 5 Similar Questions Free →

All Euclid's Division Lemma practice questions

More Class 10 Euclid's Division Lemma practice

Find the largest number which divides 626, 3127 and 15628 leaving remainders 1, 2 and 3…Euclid's Division Lemma states that for positive integers a and b, there exist unique…In Euclid's Division Lemma a = bq + r, the integer b is called the:Any positive even integer can be written in which form (q is some integer)?Any positive odd integer is of the form 2q + 1. The next form for an odd integer is 4q +…