Art of Problem Solving

Sierpinski triangle: Difference between revisions

James4l (talk | contribs)
New page: The Sierpinski triangle, named after Wacław Sierpiński, is formed by parity of the Pascal Triangle, coloring a cell black if odd and white if even. It is Rule 90 (Binary: 010110...
 
James4l (talk | contribs)
No edit summary
Line 1: Line 1:
The Sierpinski triangle, named after [[Wacław Sierpiński]], is formed by parity of the [[Pascal Triangle]], coloring a cell black if odd and white if even.
The Sierpinski triangle, named after [[Wacław Sierpiński]], is formed by parity of the [[Pascal Triangle]], coloring a cell black if odd and white if even.


It is Rule 90 (Binary: 01011010) in [[1-D Binary]] [[Cellular Automaton|CA]].
It is Rule 90 (Binary: 01011010) in [[1-D Binary Cellular Automaton|1-D Binary]] [[Cellular Automaton|CA]].

Revision as of 00:35, 7 December 2008

The Sierpinski triangle, named after Wacław Sierpiński, is formed by parity of the Pascal Triangle, coloring a cell black if odd and white if even.

It is Rule 90 (Binary: 01011010) in 1-D Binary CA.