Skip to main content

A(z) Combinations Permutations kiszámítása

Mi az a Combinations Permutations?

Combinations count ways to choose items where order does not matter. Permutations count ways where order does matter. Both use factorials and appear in probability, statistics, and combinatorics.

Útmutató lépésről lépésre

  1. 1Permutations (order matters): P(n,r) = n! / (n−r)!
  2. 2Combinations (order irrelevant): C(n,r) = n! / (r!(n−r)!)
  3. 3Rule of thumb: if you can swap two items and get a different result, use permutations

Worked Examples

Bemenet
Choose 3 from 10 (order matters)
Eredmény
720
P(10,3) = 10×9×8 = 720
Bemenet
Choose 3 from 10 (order irrelevant)
Eredmény
120
C(10,3) = 720/6 = 120
Bemenet
Lotto: 6 from 49
Eredmény
13,983,816
C(49,6)

Beállítások

AdatvédelemFeltételekRólunk© 2026 PrimeCalcPro