Grades 9-10 Video Solutions 2022-2022_9-10

Video Transcription

Question 19. There are three paths through our city park. A tree is planted in the middle of the park as shown.  What is the smallest number of trees that need to be planted so that there is the same number of trees on both sides of each of the paths?  Take a look at the paths and the tree. Now we can start off by erasing two paths and adding a tree on the other side.  Now we have to return the paths. Now we can remove two other paths and look at one path. Again, we are fine here because we have one tree on each side, so they are equal.  Now we have to do this with the last path, removing the other two paths. We see that we need to add two trees to make it equal on every side.  If we return the trees, we will see that all we need to do is add three trees to make it equal on every side of the path. So the answer is C, three.

Video Summary

The problem involves ensuring an equal number of trees on both sides of each path in a city park, given one existing tree. Initially, the method involves focusing on one path at a time by temporarily ignoring the other two and observing the tree balance. After adjusting for each path, it is determined that planting three additional trees will achieve the desired balance across all paths. Therefore, the smallest number of trees needed to plant to balance each path is three.

Keywords

tree balance

city park

path adjustment

tree planting

equal distribution