There are two kinds of tree planting problems: one is a closed pattern, such as a circle or a square, and the other is a non-closed pattern road, which is not connected end to end.
There are three kinds of unclosed graphs: the number of trees planted at both ends, the distance between trees = the number of line segments+1= the number of trees.
How many meters are planted in one section? Tree spacing = number of sections = number of plants.
Don't plant trees at both ends. Tree spacing = number of line segments-1= number of trees.
Perimeter of closed graph ÷ tree spacing = number of trees.
Reciting formula and planting formula are as follows:
The reciting formula and formula of tree planting problem are as follows: non-closed line, planting trees at both ends, number of segments = tree-1. Only one end is planted with trees, and the number of segments = trees. No trees are planted at both ends, and the number of segments = tree+1. The problem of planting trees is regular, except for spaced trees; Comparing trees with space, the most important thing is to solve the problem: two trees are 1, and one tree is equal to.
Formula summary of tree planting problem:
Planting trees is a common problem in mathematics. In order to be more intuitive, it is illustrated by graphic method. Trees are represented by points, and the lines along which trees follow are represented by lines, thus transforming the problem of planting trees into the problem of the relationship between "points" on an unclosed or closed line and the number of line segments between two adjacent points.