|
|
|
|
|
|
|||
|
|
|
|
|
|
|||
|
|
|
|
|||||
|
|
|
|
|
|
|||
|
|
|
||||||
Generalized Sierpinski's Gasket in ColorThis is a Java applet which shows
the entries of the first 240 rows of Pascal's Triangle as small
dots of a color based on the remainder upon division by n,
a number between 2 and 22. To change n, use the slider at
the top of the screen; n is initialized as 2, and the only
color turned on is 1; the pattern made by 1 (mod 2) is known as
Sierpinski's Gasket or Sierpinski's Triangle; choosing different n
and turning on different colors gives you different patterns; when a
number k is chosen, the phrase k (mod n) is
written on the screen in the color that will be used for the dots
corresponding to that number. One of the identities in Category 5
is Lucas Theorem, which will
tell us whether a particular binomial coefficient is even or odd, and
can be used to tell how many entries in any given row of Pascal's
Triangle are even or odd. The idea is to check the binary
representations of the upper and lower indices, n and k respectively, and if k has a 1 in a place where n has a 0, the binomial coefficient
will be even, and otherwise it will be odd.
The applet looks best when run in full screen mode. If the box below is just a grey rectangle, you can put Java on your machine for free through this link |
|
Some pretty patterns: |