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\).

ngoku Akukho calculator icwangcisa le nto, kodwa iinxalenye zayo zibalaseleyo. Zama enye ezantsi, okanye ubhale yakho.

⌨ Udidi ✎ Zoba

Ingxaki yakho ye-matematics

π I-Solve

Iinkqubo (1)

Zama nganye kwiphepha kuqala. Bonisa umyalezo ozakuvavanywa; eziqinisekisiweyo zingavuliwa kwisolutioner kwinyathelo ngalinye.

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

   Umsebenzi Icebo

Ukugcina umsebenzi wakho

I akhawunti ekhululekileyo idibanisa amaphetshana kwi ncwadi nganye, irekhodi lento ogqibe ngayo, iingxaki zakho ezisoliweyo kwindawo enye, nomfundi onokuthi ubuze malunga nale phepha. IiMathematiki ngokwazo zivuliwe kubo bonke, bangeniswe okanye hayi.

Bhalisa Igama elithile

Iimpawu ezisetyenziswa apha

Nqakraza nasiphi na isibonakaliso sokuqonda okupheleleyo, umfanekiso, nokuba iileta zonke zithetha ntoni.

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

Imibuzo abantu bebuza

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.

Iindawo zephepha zitshintshiwe Keller & Trotter, Applied Combinatorics (CC BY-SA 4.0). Igqityiwe kwaye iphinde yacaciswa apha; iimpazamo zethu.

IiNkqubo 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