Tag Archives: Pascal’s triangle

Using Abstract Algebra To Understand Basic Combinatorics

Pascal’s triangle has many fascinating properties. One of them is for any given prime number p, the number of k-element subsets (0< k < p) of a p-element set is divisible by p: [tex]p | \binom{p}{k}\qquad \qquad \qquad (*)[/tex] You … Continue reading

Posted in Algebra, Combinatorics, Mathematics | Tagged | 5 Comments