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

现在轮到你 没有计算器能解决这一个问题, 但其中的碎片是可以计算的。 请在下面尝试一个, 或者输入您自己的 。

⌨ 类型 ✎ 拔出它

你的数学问题

π 解决

实践 (1)

先在纸上试一个。 将答案显示为检查; 校验的答案可以在求解器中打开, 每一步都可用 。

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

   通过它工作 提示

保持你自己的工作

免费账户在每一课上都添加注解, 记录你完成的, 在一个地方解决的, 以及您可以询问的关于此页的导师。 数学本身向每个人开放, 是否签名 。

签名上签名 登录

此处所用符号

输入完整定义、图片和其中每个字母的含义的符号。

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

人们对人们提出的问题

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.

本页部分内容从 Keller & Trotter, Applied Combinatorics (CC BY-SA 4.0). 在这里进行浓缩和重新解释;错误属于我们。

更多 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