HOME | DD

Description
Base : pascal's triangle
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 X X 5 1 ...(where X=10)

The mathematical stuff
Each number is the sum of the two above. 1's are set on the first column and on the diagonal. Then, we can consider those numbers modulo a giver integer. For the sake of the example, let's make the triangle mod 10, starting on line 5 : ... 1 4 6 4 1 1 5 0 0 5 1 1 6 5 0 5 6 1 1 7 1 5 5 1 7 1 ...
The colouring
We can now assign a color to each remainder after the division by 100 (I made an image mod 100). 0 gives a black pixel (this creates those black triangle holes). We then get this image of a pseudo-Serpinski triangle (mod 2 gives a perfect Sierpinski triangle).

What's more
It seems like choosing a prime number modulo base gives a brand new image, whereas a composite integer apparently gives a superposition of prime plots. Why is it so ? Is there a pure mathematical explanation ? Can we predict what the plot looks like by only knowing the prime decomposition of the modulo base ?

Description
Base : pascal's triangle
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 X X 5 1 ...(where X=10)

The mathematical stuff
Each number is the sum of the two above. 1's are set on the first column and on the diagonal. Then, we can consider those numbers modulo a giver integer. For the sake of the example, let's make the triangle mod 10, starting on line 5 : ... 1 4 6 4 1 1 5 0 0 5 1 1 6 5 0 5 6 1 1 7 1 5 5 1 7 1 ...
The colouring
We can now assign a color to each remainder after the division by 100 (I made an image mod 100). 0 gives a black pixel (this creates those black triangle holes). We then get this image of a pseudo-Serpinski triangle (mod 2 gives a perfect Sierpinski triangle).

What's more
It seems like choosing a prime number modulo base gives a brand new image, whereas a composite integer apparently gives a superposition of prime plots. Why is it so ? Is there a pure mathematical explanation ? Can we predict what the plot looks like by only knowing the prime decomposition of the modulo base ?