Snowflakes can be constructed by starting with an equilateral triangle (Fig. \(1\)), then repeatedly altering each line segment of the resulting polygon as follows:
\(1.\) Divide each outer line segments into three segments of equal length.
\(2.\) Add an equilateral triangle that has the middle segment from step \(1\) as its base.
\(3.\) Remove the line segment that is the base of the triangle from step \(2\).
\(4.\) Repeat the above steps for a number of iterations, \(n\).
The \(1\)st, \(2\)nd and \(3\)rd iteration produces the snowflakes in Fig. \(2\), Fig. \(3\) and Fig. \(4\) respectively.
Write down the number of sides in the polygons in Fig.\(1\), Fig. \(2\) and Fig. \(3\), and deduce, with clear explanations, that the number of new triangles added in the \({{n}^{th}}\) iteration is \({{T}_{n}}=k\left( {{4}^{n}} \right)\) where \(k\) is a constant to be determined.
[2]Determine the least number of iterations needed for the area of the snowflake to exceed \(99\%\) of the area of a Koch snowflake.
[3]Video solution locked
A free account saves your progress; this video needs tuition enrolment.
680+ questions here come with free worked solutions. A free account saves your questions and progress; this one needs tuition enrolment.
Create a free account to practise similar questions.
Need help? Join our JC Math tuition classes.
Learn more