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}\).
Sekarang kau Tiada kalkulator yang dapat menyelesaikan ini, tetapi bahagian-bahagian boleh dikira. Cuba salah satu di bawah, atau taipkan sendiri.
Akaun percuma menambah nota pada setiap pengajaran, rekod apa yang anda selesaikan, masalah yang anda selesaikan di satu tempat, dan seorang guru yang anda boleh tanya tentang halaman ini. Matematik itu sendiri terbuka kepada semua orang, sama ada anda log masuk atau tidak.
Daftar Masuk Log masukSimbol yang digunakan di sini
Tekan simbol mana-mana untuk definisi penuh, gambar, dan apa makna setiap huruf dalamnya.
Soalan yang orang tanya
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.
Bahagian halaman ini diadaptasi dari Keller & Trotter, Applied Combinatorics (CC BY-SA 4.0). Dikemas kini dan dijelaskan di sini; kesilapan adalah kami.
Lebih dalam 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