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.

Eksempel på arbeid · expand (a + b)^6

Algebra · Expanding

Expand (a + b)^6

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

Steg for trinn

  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.

Vis svaret
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}

Nå har du Velg et problem, eller skriv inn, eller tegne din egen. Hvert steg, et bilde, svaret skjult til du spør.

Fortsett ditt eget arbeid

En gratis konto legger til notater om hver leksjon, en oversikt over hva du har fullført, problemene du har løst på ett sted og en lærer du kan spørre om. Matematikkene er åpne for alle, signerte på eller ikke.

Registrer Logg inn

Symboler som brukes her

Trykk på et symbol for den fulle definisjonen, et bilde og hva hver bokstav i det betyr.

Hvordan: Binomial coefficients and Pascal's triangle

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

Spørsmål folk stiller

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.

Mer i Combinatorics & Graph Theory

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