Abstract
There are several methods given for constructing the Sierpinski Triangle (ST). In particular, the ST can be created as a countably infinite intersection of contained figures, or as the countably infinite union of triangles. At first glance they both appear to create the same object. In this paper, we show that they are not the same. In addition, we analyze and compare with the previous two methods, a third method of constructing the ST which entails generating a countable number of points using an algorithm.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
