Patterns in Pascal’s Triangle Modulo m

This applet looks at patterns in the Pascal triangle based on the divisibility of the binomial coefficients. If we represent the entries in Pascal’s triangle as points, and color the odd and the even numbers in different colors, we will notice the fractal pattern of the [url=https://ggbm.at/SCrY9eDw]Sierpinski triangle[/url]. [br][br]The applet below is a generalization of this idea. Instead of looking only in divisibility by two, we can explore the patterns of divisibility of the binomial coefficients by any number [math]m[/math]. [br]Another interesting question is to look for patterns in the distribution of the binomial coefficients based on the possible remainders [math]0,1,2,\dots m-1[/math] (the residue classes).[br][list][*]To display one residue class, enter a number between [math]0[/math] and [math]m-1[/math] on the place of [math](-1)[/math] in the input box.[br][/*][*]To display simultaneously several consecutive residue classes, click on the green arrow.[br][/*][/list]

Information: Patterns in Pascal’s Triangle Modulo m