Highest Common Factor and Its Applications

Highest Common Factor and Its Applications

TGM Original Questions

Arthur has \(3\) pieces of rope with lengths of \(36\) cm, \(144\) cm and \(252\) cm.

He wishes to cut the \(3\) pieces of rope into smaller pieces of rope of equal length with no remainders.

  1. What is the greatest possible length of the cut rope?
  2. How many of such rope with the greatest possible length can he get?

Video Solution:

Video Solution

Video solution locked

A free account saves your progress; this video needs a course plan.

Solution:

Solution locked

680+ questions here come with free worked solutions. A free account saves your questions and progress; this one needs a course plan.

Answer:(a) \(36\text{ cm}\) (b) \(12\) ropes

Need help? Join our E-Maths tuition for O-Level success.

Learn more