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}\).
Сега ти.
Никой калкулатор не се урежда този, но парчетата от него са комунтирани. Опитайте един по-долу, или напишете своя собствен.
Запази си работата.
Безплатна сметка добавя бележки за всеки урок, запис на това, което сте завършили, решавате проблеми на едно място, и учител, който можете да попитате за тази страница. Самата математика е отворена за всеки, подписан или не.
Докоснете всеки символ за пълното определение, снимка и какво означава всяка буква в него.
Какво означава всяка част
Замисли си.
Заслужава да знаеш
Примери
Също така използвани в това обяснение
Въпроси, които хората задават
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.