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

Megdolgozott példa: 5 choose 2

Arithmetic · Arithmetic

Evaluate 10

10

Lépésről lépésre

  1. 10 = 10

    Evaluate.

Mutasd meg a választ!
10

Próbáld a sajátodat.

Még több Statistics & Probability

Sampling and dataDescribing data with graphsMean, median and modeProbabilityDiscrete random variablesContinuous random variablesThe normal distributionThe central limit theoremConfidence intervalsHypothesis testingComparing two samplesChi-square testsLinear regression and correlationANOVA and the F distribution