Practice30Create account

Three measuring tapes of lengths 825 cm, 675 cm and 450 cm need to be cut into equal pieces of the greatest possible length.
Find the greatest possible length (in cm) of each piece using Euclid's algorithm.

Class 10Euclid's Division LemmaNumber Systems
  • A150
  • B67
  • C83
  • D75

Step-by-Step Solution

HCF(825,675): ; ; > 75. HCF(75,450) = 75 since . Greatest length = 75 cm.
Answer: D) 75

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

By Euclid's Division Lemma, the HCF of two numbers also divides their difference. The…Three bells in a Mumbai temple toll at intervals, and a student wants the greatest…Find the largest number that divides 1230 and 1926 leaving remainder 12 in each case.…Using Euclid's Division Lemma, any positive integer is 5q, 5q+1, 5q+2, 5q+3 or 5q+4. For…A gardener has 1001 roses and 910 marigolds. He makes the maximum number of identical…