Pascal’s triangle
On the n-th “horizontal” row (counting the apex as n=0) stand Cn0,Cn1,…,Cnn.
Pascal’s rule Cnk=Cn−1k−1+Cn−1k builds the triangle: each interior entry is the sum of the two numbers above it.
Row sum: ∑k=0nCnk=2n — the number of all subsets of an n-element set.
Boundary 1s on the left and right — Cn0=Cnn=1
Content is available with subscription.
Get full access to all courses on the platform for one year with a single payment.
▼
Unlike other platforms that charge per course, here you get everything for one price, and after one year of use there will be no automatic charge for the following year.