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.

Radni primjer · expand (a + b)^6

Algebra · Expanding

Expand (a + b)^6

\left(a + b\right)^{6}

Korak po korak

  1. \left(a + b\right)^{6}

    Start from the expression.

  2. 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.

Otkrij odgovor
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}

Now you Izaberite problem, ili tipkanje ili nacrtati vlastiti. Svaki korak, slika, odgovor skriven dok ne pitate.

Zadrži svoj rad

Besplatan račun dodaje bilješke na svakoj lekciji, zapis onoga što ste završili, rješeni problemi na jednom mjestu, i tutor možete pitati o ovoj stranici. Sama matematika je otvorena za sve, potpisani ili ne.

Prijavi se Prijava

Simboli koji se koriste ovdje

Dodirnite bilo koji simbol za punu definiciju, sliku, i što znači svako slovo u njoj.

Kako: Binomial coefficients and Pascal's triangle

  1. Start from the expression.
  2. Distribute (multiply out) the products.

Pitanja koja ljudi postavljaju

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.

Više u Combinatorics & Graph Theory

The counting principlesPigeonhole principle and inclusion, exclusionRecurrences and generating functionsGraphs: vertices, edges, degreesPaths, cycles, trees, Euler and HamiltonColouring and planar graphs