<meta http-equiv="refresh" content="1; url=/nojavascript/"> Self-Similarity ( Read ) | Geometry | CK-12 Foundation
Skip Navigation


Best Score
Practice Self-Similarity
Best Score
Practice Now


What if you were given an object, like a triangle or a snowflake, in which a part of it could be enlarged (or shrunk) to look like the whole object? What would each successive iteration of that object look like? After completing this Concept, you'll be able to use the idea of self-similarity to answer questions like this one.

Watch This

CK-12 Foundation: Chapter7SelfSimilarityA

Brain Waves: Sierpinski Triangle


When one part of an object can be enlarged (or shrunk) to look like the whole object it is self-similar .

To explore self-similarity, we will go through some examples. Typically, each step of a process is called an iteration. The first level is called Stage 0.

Example A (Sierpinski Triangle)

The Sierpinski triangle iterates a triangle by connecting the midpoints of the sides and shading the central triangle (Stage 1). Repeat this process for the unshaded triangles in Stage 1 to get Stage 2.

Example B (Fractals)

Like the Sierpinski triangle, a fractal is another self-similar object that is repeated at smaller scales. Below are the first three stages of the Koch snowflake.

Example C (The Cantor Set)

The Cantor set is another example of a fractal. It consists of dividing a segment into thirds and then erasing the middle third.

Watch this video for help with the Examples above.

CK-12 Foundation: Chapter7SelfSimilarityB


When one part of an object can be enlarged (or shrunk) to look like the whole object it is self-similar .

Guided Practice

1. Determine the number of edges and the perimeter of each snowflake shown in Example B. Assume that the length of one side of the original (stage 0) equilateral triangle is 1.

2. Determine the number of shaded and unshaded triangles in each stage of the Sierpinkski triangle. Determine if there is a pattern.

3. Determine the number of segments in each stage of the Cantor Set. Is there a pattern?



Stage 0 Stage 1 Stage 2
Number of Edges 3 12 48
Edge Length 1 \frac{1}{3} \frac{1}{9}
Perimeter 3 4 \frac{48}{9} = \frac{15}{3}


Stage 0 Stage 1 Stage 2 Stage 3
Unshaded 1 3 9 27
Shaded 0 1 4 13

The number of unshaded triangles seems to be powers of 3: 3^0, 3^1, 3^2, 3^3, \ldots . The number of shaded triangles is the sum of the number of shaded and unshaded triangles from the previous stage. For Example, the number of shaded triangles in Stage 4 would equal 27 + 13 = 40.

3. Starting from Stage 0, the number of segments is 1, 2, 4, 8, 16, \ldots . These are the powers of 2. 2^0, 2^1, 2^2,\ldots .

Explore More

  1. Draw Stage 4 of the Cantor set.

Use the Cantor Set to fill in the table below.

Number of Segments Length of each Segment Total Length of the Segments
Stage 0 1 1 1
Stage 1 2 \frac{1}{3} \frac{2}{3}
Stage 2 4 \frac{1}{9} \frac{4}{9}
Stage 3 (2) (3) (4)
Stage 4 (5) (6) (7)
Stage 5 (8) (9) (10)
  1. How many segments are in Stage n ?
  2. What is the total length of the segments in Stage n?.
  3. A variation on the Sierpinski triangle is the Sierpinski carpet, which splits a square into 9 equal squares, coloring the middle one only. Then, split the uncolored squares to get the next stage. Draw the first 3 stages of this fractal.
  4. How many colored vs. uncolored squares are in each stage?
  5. Use the internet to explore fractals further. Write a paragraph about another example of a fractal in music, art or another field that interests you.

Image Attributions


Email Verified
Well done! You've successfully verified the email address .
Please wait...
Please wait...

Original text