maths.free › Combinatorics & Graph Theory › Generating Functions › An Application of the Binomial Theorem
An Application of the Binomial Theorem
In this section, we see how can be used to derive another useful identity. We begin by establishing a different recursive formula for P(p,k) than was used in our definition of it.
An Application of the Binomial Theorem
In this section, we see how can be used to derive another useful identity. We begin by establishing a different recursive formula for \(P(p,k)\) than was used in our definition of it.
Our goal in this section will be to invoke with the exponent \(p=-1/2\). To do so in a meaningful manner, we need a simplified expression for \(C(-1/2,k)\), which the next lemma provides.
We will return to this generating function in , where it will play a role in a seemingly new counting problem that actually is a problem we've already studied in disguise.
Now recalling about the coefficients in the product of two generating functions, we are able to deduce the following corollary of by squaring the function \(f(x) = (1-4x)^{-1/2}\).
Zdaj pa ti. Noben kalkulator ne poravna tega, vendar kosov tega je kompakten. Poskusite enega spodaj, ali vpišite svoje.
Brezplačen račun dodaja opombe o vsaki lekciji, zapis o tem, kar ste končali, vaše rešene težave na enem mestu, in tutor lahko vprašate o tej strani. Sama matematika je odprta za vse, prijavljena ali ne.
Registriraj se PrijavaSimboli, ki se uporabljajo tukaj
Tapnite vsak simbol za popolno opredelitev, sliko in kaj pomeni vsaka črka v njej.
Vprašanja, ki jih ljudje sprašujejo
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.
Deli te strani so prilagojeni od Keller & Trotter, Applied Combinatorics (CC BY-SA 4.0). Tu je zbrano in razjasnjeno. Napake so naše.
Več v 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