Download-Download-Download and use Turbo Speed for best results. Slow and Crawl do not work on the server;=< Flash does not work for this project;=< Press Pascal's Triangle to get an introduction to the Pascal's Triangle and the visual patterns that this projects shows. select the divisor then click the fast button. The cells in black are diviable by the divisor the remainder color for the other cells are shown in the legend on the left. Slow and Crawl buttons that show a lot more cells are very slow on the server I recommend you download and run in turbo speed for these two. The patterns for prime numbers are quite interesting. And, composite bases are more complex and it might be more of a challenge to figure out the structure. Pascal's triangle is a triangular array of the binomial coefficients in a triangle. It is named after the French mathematician Blaise Pascal in much of the Western world, although other mathematicians studied it centuries before him in India, Persia, China, Germany, and Italy. The rows of Pascal's triangle are conventionally enumerated starting with row n = 0 at the top. The entries in each row are numbered from the left beginning with k = 0 and are usually staggered relative to the numbers in the adjacent rows. A simple construction of the triangle proceeds in the following manner. On row 0, write only the number 1. Then, to construct the elements of following rows, add the number directly above and to the left with the number directly above and to the right to find the new value. Each cell in the nth row and kth diagonal in the Pascal's Triangle can be represented by (n k)=n!/(n-k)!k! you can figure out when any element (n k) is divisible by any prime p looking at these patterns if you are clever! The elegant engine comes from darthpickly and my thanks and praise go to him. I used my own version that is now posted with lists for some of the graphics.
