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.
Gumagana halimbawa · expand (a + b)^6
Hakbang-hakbang
- \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.
Ipahayag ang sagot
Ngayon ikaw Pumili ng isang problema, o i-type o gumuhit ng iyong sarili. Sa bawat hakbang, isang larawan, ang sagot na nakatago hanggang sa hilingin mo.
Ang isang libreng account ay nagdaragdag ng mga tala sa bawat aralin, isang tala ng kung ano ang iyong natapos, ang iyong mga nalulutas na problema sa isang lugar, at isang guro na maaari mong tanungin tungkol sa pahinang ito. Ang matematika mismo ay bukas sa lahat, naka-sign in o hindi.
Mag-sign Up Mag-loginMga simbolong ginagamit dito
I-tap ang anumang simbolo para sa buong kahulugan, isang larawan, at kung ano ang ibig sabihin ng bawat titik sa ito.
Paano: Binomial coefficients and Pascal's triangle
- Start from the expression.
- Distribute (multiply out) the products.
Mga katanungan na tanong ng mga tao
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.
Higit pa sa Combinatorics & Graph Theory
The counting principlesPigeonhole principle and inclusion, exclusionRecurrences and generating functionsGraphs: vertices, edges, degreesPaths, cycles, trees, Euler and HamiltonColouring and planar graphs