The Binomial Theorem

The Binomial Theorem

Here is a truly basic result from combinatorics kindergarten.

Example

There are times when we are interested not in the full expansion of a power of a binomial, but just the coefficient on one of the terms. The gives that the coefficient of \(x^5y^8\) in \((2x-3y)^{13}\) is \(\binom{13}{5}2^{5}(-3)^8\).

Now you Nijedan kalkulator ne slaže ovaj, ali komadiće su komputentni. Pokušajte jedan ispod, ili upišite vlastiti.

⌨ Tip ✎ Nacrtaj

Tvoj problem s matematikom.

π Riješi

Vježba (1)

Pokušajte svaki na papiru prvo. Otkrijte odgovor provjeriti; provjereni mogu biti otvoreni u rješavač za svaki korak.

1. Explain how you can use to give yet another proof of the identity \[\begin{aligned}\end{aligned}\].

   Prođi kroz to. Savjet

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.

\binom{n}{k}binomial coefficient, "n choose k"
Number of k-element subsets of n things: n!/(k!(n−k)!).iimaginary unit
i² = −1.n!factorial
n × (n−1) × … × 1; the number of orderings of n things. 0! = 1.\sum_{k=1}^{n} a_ksummation
Add a_k for k = 1 up to n.\prod_{k=1}^{n} a_kproduct
Multiply a_k for k = 1 up to n.\emptysetempty set, cardinality
The set with no elements; the number of elements of A.

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.

Dijelovi ove stranice prilagođeni su od Keller & Trotter, Applied Combinatorics (CC BY-SA 4.0). Ovdje su kondenzirane i objašnjene; greške su naše.

Više u Combinatorics & Graph Theory

The counting principlesPigeonhole principle and inclusion, exclusionBinomial coefficients and Pascal's triangleRecurrences and generating functionsGraphs: vertices, edges, degreesPaths, cycles, trees, Euler and HamiltonColouring and planar graphs