Pascal's triangle
Elementary combinatorial analysis
Article REF: AF200 V1
Pascal's triangle
Elementary combinatorial analysis

Author : Louis COMTET

Publication date: April 10, 2001 | Lire en français

Logo Techniques de l'Ingenieur You do not have access to this resource.
Request your free trial access! Free trial

Already subscribed?

3. Pascal's triangle

3.1 Triangular recurrence

Thanks to the previous results, we now have an explicit formula (Theorem5) for the number (nk) of k-element parts of an n-element set N, which is given by : |N|=n.

We can arrange these numbers in a double-entry table, with the rows indexed by n ∊

You do not have access to this resource.
Logo Techniques de l'Ingenieur

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed?

Ongoing reading
Pascal's triangle

Article included in this offer

"Mathematics"

( 165 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details
Contact us
Contact our team FAQ