Numsprite數靈精Play free
中文

Maths olympiad question · P4–P5★★★ Hard

Tree planting: olympiad question 7

A hard question on tree planting for P4–P5, with a step-by-step solution, diagrams and the answer. Common in the Hua Xia Cup's P2 to P5 papers. Sawing logs, striking clocks and lining up lamp posts are all the same problem.

The question

Trees line both sides of a straight road: on each side they run from one end to the other, with a tree at each end and neighbouring trees 8 m apart.

There are 32 trees in all.

Both sides are now to be replanted with a tree every 6 m, still with trees at both ends.

An old tree that already stands on a new spot stays; the other old trees are removed, and every new spot without a tree gets a new one.

How many new trees are planted?

Show the hints (3)
  1. Hint 1: Look at one side first: how many trees does it have? From that, work out how long the road is.
  2. Hint 2: How many trees does one side need under the new plan? Which of those spots already have a tree that can stay?
  3. Hint 3: The road is 120 m. Spots that keep their tree come every 24 m, both ends included: 6 per side. The new plan needs 21 per side.

Worked solution

Have a go first, then read the solution step by step.

  1. 1.One side has 32 ÷ 2 = 16 trees, so 15 gaps: the road is 15 × 8 = 120 m.
  2. 2.New plan, one side: 120 ÷ 6 = 20 gaps, 20 + 1 = 21 trees.
  3. 3.Trees that stay are at common multiples of 8 and 6, every 24 m: 120 ÷ 24 = 5 gaps, 6 trees per side.
  4. 4.One side needs 21 − 6 = 15 new trees (3 in each 24 m stretch, 5 stretches: 3 × 5 = 15); both sides: 15 × 2 = 30.
  5. ⚠️Common mistake: treating all 32 trees as one side when finding the road's length, or forgetting to double at the end.

Answer: 30 trees

Play more like this in Numsprite (unlimited questions, instant marking) →A free maths game: every level free from Easy to Expert (★ to ★★★★), unlimited questions, no download