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}\).
Ahora tú Ninguna calculadora resuelve este, pero las piezas son computables. Pruebe uno abajo, o escriba el suyo.
Una cuenta gratuita añade notas sobre cada lección, un registro de lo que has terminado, tus problemas resueltos en un lugar, y un tutor que puedes preguntar sobre esta página. Las matemáticas en sí están abiertas a todos, se han registrado o no.
Registrarse Inicio de sesiónSímbolos utilizados aquí
Toque cualquier símbolo para la definición completa, una imagen, y lo que cada letra en ella significa.
Preguntas que la gente hace
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.
Partes de esta página están adaptadas de Keller & Trotter, Applied Combinatorics (CC BY-SA 4.0). Condensados y re-explicados aquí; los errores son nuestros.
Más en 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