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

Arbejdstxrd eksempel · 5 choose 2

5 choose 2

5,\ 2

Trin for trin

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

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

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

Afslør svaret
\binom{5}{2} = 10

Nu er du Vælg et problem, eller skriv eller tegne din egen. Hvert skridt, et billede, svaret skjult, indtil du spørger.

Fortsæt med at arbejde

En gratis konto tilføjer noter om hver lektion, en rekord over, hvad du har afsluttet, dine løste problemer på ét sted, og en vejleder, du kan spørge om denne side. Matematik selv er åben for alle, logget på eller ej.

Tilmeld dig Login

Symboler brugt her

Tryk på ethvert symbol for den fulde definition, et billede, og hvad hvert bogstav i det betyder.

Hvordan: Counting: permutations and combinations

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

Spørgsmål folk spørger

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.

Mere i Statistics & Probability