Practice30Create account

A rectangular courtyard is 18 m 72 cm long and 13 m 20 cm broad. It is to be paved with identical square tiles of the largest possible size.
Find the side (in cm) of each square tile using Euclid's algorithm.

Class 10Euclid's Division LemmaNumber Systems
  • A48
  • B26
  • C24
  • D22

Step-by-Step Solution

Length = 1872 cm, breadth = 1320 cm. HCF(1872,1320): ; ; ; ; ; . HCF = 24 cm.
Answer: C) 24

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 greatest number which divides 285 and 1249 leaving remainders 9 and 7…Two tankers contain 850 litres and 680 litres of milk. The milk is to be measured…Show that one and only one out of n, n+2, n+4 is divisible by 3. For n = 7, exactly one…Find the largest number that divides 398, 436 and 542 leaving remainders 7, 11 and 15…Using Euclid's algorithm, HCF(a, b) = HCF(b, r) where a = bq + r. If HCF(1620, 1725) is…