maths.free › Statistics & Probability › Counting: permutations and combinations

Counting: permutations and combinations

Factorials, ordered and unordered selections.

n! counts the orderings of n things. Choosing k of them in order is n!/(n − k)!; ignoring the order divides by k! again, giving the binomial coefficient “n choose k”. These numbers are Pascal's triangle and the coefficients of (a + b)ⁿ.

工作范例 · 5 choose 2

5 choose 2

5,\ 2

一步

  1. \binom{5}{2} = \frac{5!}{2!\,(5-2)!}

    Unordered selections: n! / (k! (n−k)!).

  2. = \frac{120}{2 \times 6} = 10

发送答案
\binom{5}{2} = 10

现在轮到你 选择问题, 输入或绘制您自己的 。 每一步, 图片, 答案隐藏到您询问 。

保持你自己的工作

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

签名上签名 登录

此处所用符号

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

如何: Counting: permutations and combinations

  1. Unordered selections: n! / (k! (n−k)!).

人们对人们提出的问题

Mean or median, which should I use?

Median when the data have outliers or a long tail (incomes, house prices); mean when the data are roughly symmetric and you want every value to count. Report both if they disagree. The gap is itself information.

What does a p-value actually say?

The probability of seeing data at least this extreme if the null hypothesis were true. It is not the probability that the null hypothesis is true.

Why divide by n − 1 for the sample variance?

The sample mean sits closer to the sample than the true mean does, so squared deviations from it are slightly too small on average; dividing by n − 1 instead of n corrects the bias.

更多 Statistics & Probability