Français
3. Pascal's triangle
3.1 Triangular recurrence
Thanks to the previous results, we now have an explicit formula (Theorem5) for the number of k-element parts of an n-element set N, which is given by :
We can arrange these numbers in a double-entry table, with the rows indexed by n ∊
The Ultimate Scientific and Technical Reference
A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors
+ More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year
From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects
This article is included in
Mathematics
This offer includes:
Knowledge Base
Updated and enriched with articles validated by our scientific committees
Services
A set of exclusive tools to complement the resources
Practical Path
Operational and didactic, to guarantee the acquisition of transversal skills
Doc & Quiz
Interactive articles with quizzes, for constructive reading
Ongoing reading
Pascal's triangle
Pascal's triangle
References
The Ultimate Scientific and Technical Reference
A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors
+ More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year
From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects
