Pascal's Triangle - Divisibility Patterns     misc

Leonid Petrov


Simulation Info

Pascal's Triangle - Divisibility Patterns     misc

Leonid Petrov

Interactive pixel visualization of Pascal's triangle divisibility patterns. Dots mark binomial coefficients divisible by a chosen modulus, revealing fractal Sierpinski-like structures for prime moduli. Adjust rows (up to 2000) and modulus, then pan and zoom to explore the pattern. WebAssembly-optimized rendering.

This simulation visualizes Pascal’s triangle with dots colored based on whether their values are divisible by a given modulus. This creates interesting fractal-like patterns, especially for prime moduli.

About This Simulation

Pascal’s triangle is a triangular array of numbers where each number is the sum of the two numbers directly above it. This simulation visualizes divisibility patterns by showing dots only where the Pascal’s triangle values are divisible by the chosen modulus.

Controls:

Features:

Interesting Patterns to Try:

The patterns emerge from the properties of binomial coefficients and modular arithmetic, revealing deep mathematical structures within Pascal’s triangle.


code

(note: parameters in the code might differ from the ones in simulation results below)

Dear colleagues:

Feel free to use code (unless otherwise specified next to the corresponding link), data, and visualizations to illustrate your research in talks and papers, with attribution (CC BY-SA 4.0 (opens in new tab)). Some images are available in very high resolution upon request. I can also produce other simulations upon request - email me at lenia.petrov@gmail.com
This material is based upon work supported by the National Science Foundation under Grant DMS-2153869