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

Algebra · Expanding

Expand (a + b)^6

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

Қадамма-қадам

  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.

Жавобни кўрсатиш
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}

Энди сизлар Мавзуни танланг, ёзинг ёки ўзингиз чизинг. Ҳар бир қадам, расм, жавоб сиз сўрагунча яширин.

Ўзингиз ишлашда давом этинг

Бепул ҳисоб ҳар бир дарсга ёзув қўшиб беради, сиз тугатган нарсалар ва ҳал қилинган масалалар бир жойда қайд этилади ва сиз бу саҳифа ҳақида устоздан сўрашингиз мумкин. Математика ўзида очиқ бўлиб, унга кириш ёки киришни истамаган ҳар кимга очиқ.

Ройхатдан ўтиш Кириш

Бу ерда қўлланилган белгилар

Барча белгилар учун тўлиқ таъриф, сурат ва ҳар бир ҳарфнинг маъносини кўриш учун белгини босинг.

Қандай: Binomial coefficients and Pascal's triangle

  1. Start from the expression.
  2. 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