maths.free › Combinatorics & Graph Theory › Binomial coefficients and Pascal's triangle
Binomial coefficients and Pascal's triangle
Identities, the binomial theorem, and combinatorial proofs.
C(n, k) counts k-subsets, is the coefficient in (a + b)ⁿ, and satisfies Pascal's rule C(n, k) = C(n−1, k−1) + C(n−1, k). Picture it: Pascal's triangle, each entry the sum of the two above. Think it: a combinatorial proof shows two formulas count the same set, no algebra needed.
مثال کار شده · expand (a + b)^6
قدم به قدم
- \left(a + b\right)^{6}
Start from the expression.
- a^{6} + 6 a^{5} b + 15 a^{4} b^{2} + 20 a^{3} b^{3} + 15 a^{2} b^{4} + 6 a b^{5} + b^{6}
Distribute (multiply out) the products.
جواب رو نشون بده
حالا تو يه مساله انتخاب کن، يا خودت رو بنويس يا بکشي هر گام، يه تصوير، جواب مخفي ميشه تا وقتي که تو بپرسي
نمادهای استفاده‌شده در اینجا
هر نماد را برای تعریف کامل، تصویر و معنی هر حرف در آن بزنید.
چطور: Binomial coefficients and Pascal's triangle
- Start from the expression.
- Distribute (multiply out) the products.
سوالاتي که مردم ميپرسن
Permutation or combination?
Ask whether order matters. A lock code is a permutation (order matters); a hand of cards is a combination (it does not).
What is a graph in this sense?
Dots (vertices) joined by lines (edges), not a plot. Road maps, social networks and molecules are graphs; questions like "is there a route" and "how few colours" are graph theory.
بیشتر در Combinatorics & Graph Theory
The counting principlesPigeonhole principle and inclusion, exclusionRecurrences and generating functionsGraphs: vertices, edges, degreesPaths, cycles, trees, Euler and HamiltonColouring and planar graphs