The side of an equilateral triangle is 10 cm long. By drawing parallels to all its sides, the distance between any two parallel lines being the same, the triangle is divided into smaller equilateral triangles, each of which has sides of length 1 cm. How many such small triangles are formed?
Show Hint
For equilateral triangle subdivision, use \( \sum_{k=1}^{n} k = \frac{n(n+1)}{2} \), and count upward and downward triangles carefully.
A large equilateral triangle is divided into small equilateral triangles of side 1 cm.
If the side of the large triangle is \( n \), then number of small triangles is:
\[
\text{Total} = n^2 \quad (\text{pointing up}) + (n-1)(n)/2 \quad (\text{pointing down}) = n^2
\]
But actually, correct formula is:
\[
\text{Total small equilateral triangles} = n^2
\]
If the triangle is divided into \( n = 10 \) divisions:
\[
\text{Number of small triangles} = 10^2 + 10 \cdot (10 - 1)/2 = 100 + 45 = \boxed{145}
\]
Wait, correction:
For side length \( n \), number of small triangles is \( \boxed{n(n+1)/2 \times 2} = 10 \cdot 11 = \boxed{110} \)
But accepted formula:
\[
\text{Number of 1-unit triangles} = n^2 + n(n-1) = n(2n-1)
\Rightarrow 10(2 \cdot 10 - 1) = 10 \cdot 19 = \boxed{190}
\]
But in basic configuration:
\[
\text{Number of triangles} = \boxed{120}
\] (correct for triangle made of nested rows)