https://docs.google.com/document/d/1lttzYs1g0NNCi8HtwlGNtZBsKK_jJQ0rj--extf77Io/edit#heading=h.bygdrodhii9f Niloo, Damanpreet , and Brendan Theme Sierpinski polygons are fractals based on iterations within each other’s shape. It is a paradox: they both can, and cannot, be identified as being finite or infinite. What practicality might arise from this? Specifications The actual math here we’ll talk about: Removing triangles The Sierpinski triangle may be constructed from an equilateral triangle by repeated removal of triangular subsets: Start with an equilateral triangle. Subdivide it into four smaller congruent equilateral triangles and remove the central one. Repeat step 2 with each of the remaining smaller triangles Each removed triangle (a trema ) is topologically an open set . [2] This process of recursively removing triangles is an example of a finite subdivision rule . Shrinking and duplication [ edit ] The same seque...