maths.freeStatistics & 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)ⁿ.

Contoh yang berhasil: 5 choose 2

Evaluate 10

10

Langkah demi langkah

  1. 10 = 10

    Evaluate.

Mengungkapkan jawabannya
10

Cobalah sendiri

Lebih dalam Statistics & Probability