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.

Kushanda muenzaniso · expand (a + b)^6

Algebra · Expanding

Expand (a + b)^6

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

Step by step

  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.

Kuratidza mhinduro
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}

Zvino iwe Choose a problem, or type or draw your own. Every step, a picture, the answer hidden until you ask.

Tenga yako yemahara

Mubhadharo wakasununguka unowedzera mazita ezvidzidzo, zvinyorwa zvezvidzidzo zvawakati wazvigadzirira, zvidzidzo zvawave uchizvigadzirisa, uye mudzidzisi waungabvunza nezvechidzidzo ichi. Maths inowanikwa kune vese, vasiri vadzidzi kana vadzidzi. Kuwana mazita ezvidzidzo zvinodiwa kunogona kuitwa pawebsite ye Maths.

Kutanga Kupinda

Mazita anoshandiswa pano

Tinya chero chiratidzo kuti uone chirevo chakazara, vhidhiyo, uye kuti chii chinoreva chero chiratidzo.

Maitiro: Binomial coefficients and Pascal's triangle

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

Mabvunzo vanhu vanobvunza

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.

More in Combinatorics & Graph Theory

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