Pascal's triangle is a triangle of numbers made with a very straight-forward rule. Despite how simple it is to construct, there are many complex patterns in Pascal's triangle which are difficult to explain at first glance. However, through the lens of combinatorics, the art of counting, we can explain the presence of such patterns and prove their existence.

A class that teaches you how to write proofs and gives an overview of the various techniques used in proofs of mathematical theorems. Covers boolean variables and boolean operators, truth tables, proof of implications, direct proofs, proof by contraposition, proof by contradiction, proof by construction, proof by cases, proof by induction and its various forms, and combinatorial proofs.