Sierpinski hexed (S). Take an equilateral triangle and remove a hexagon from the center as shown at right, leaving three equilateral triangles with sides 1/3 the length of the sides of the original triangle. Repeat the process of removing a hexagon from each sub-triangle. Repeat, repeat, repeat, forever. Make a sketch of what remains after one step, two steps, and three steps. Describe the locations of infinitely many points that are left after infinitely many steps. Let’s call the remaining points Sierpinski Dust.
Sierpinski hexed (S). Take an equilateral triangle and remove a hexagon from the center as shown at right, leaving three equilateral triangles with sides 1/3 the length of the sides of the original triangle. Repeat the process of removing a hexagon from each sub-triangle. Repeat, repeat, repeat, forever. Make a sketch of what remains after one step, two steps, and three steps. Describe the locations of infinitely many points that are left after infinitely many steps. Let’s call the remaining points Sierpinski Dust.
Sierpinski hexed (S). Take an equilateral triangle and remove a hexagon from the center as shown at right, leaving three equilateral triangles with sides 1/3 the length of the sides of the original triangle. Repeat the process of removing a hexagon from each sub-triangle. Repeat, repeat, repeat, forever. Make a sketch of what remains after one step, two steps, and three steps. Describe the locations of infinitely many points that are left after infinitely many steps. Let’s call the remaining points Sierpinski Dust.
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.