Editing Sierpiński triangle (section)

===Pascal's triangle===
[[File:Sierpinski_Pascal_triangle.svg|thumb|A level-5 approximation to a Sierpiński triangle obtained by shading the first 2<sup>5</sup> (32) levels of a Pascal's triangle white if the binomial coefficient is even and black otherwise]]
If one takes [[Pascal's triangle]] with <math>2^n</math> rows and colors the even numbers white, and the odd numbers black, the result is an approximation to the Sierpiński triangle.  More precisely, the [[limit of a sequence|limit]] as {{mvar|n}} approaches infinity of this [[Parity (mathematics)|parity]]-colored <math>2^n</math>-row Pascal triangle is the Sierpiński triangle.<ref>{{citation|title=How to Cut a Cake: And other mathematical conundrums|first=Ian|last=Stewart|publisher=Oxford University Press|year=2006|isbn=9780191500718|page=145|url=https://books.google.com/books?id=theofRmeg0oC&pg=PT145}}.</ref>

As the proportion of black numbers tends to zero with increasing ''n'', a corollary is that the proportion of odd binomial coefficients tends to zero as ''n'' tends to infinity.<ref>Ian Stewart, "How to Cut a Cake", Oxford University Press, page 180</ref>