IP1U1 SWIII Q9

IP1U1 SWIII Q9

IP 1

Trees will be planted along \(2\) roads, Privet Road and Wisteria Road. Privet Road is \(0.48\) km long, and Wisteria road is \(792\) m long. There will be a tree planted at the beginning and at the end of each road. The distance between every \(2\) consecutive trees on Privet Road is the same and this distance is also equal to the distance between every \(2\) consecutive trees on Wisteria Road.

  1. Find the maximum possible distance between \(2\) consecutive trees on both roads such that the conditions above are satisfied.
  2. Hence, find the total number of trees that are needed for both roads. Assume that trees are planted only on one side of each road.

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) \(24\text{ m}\) (b) \(55\text{ trees}\)

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

Learn more