Includes your inputs and results for this calculation, plus any additional calculations you've compared.
Share & Print
The link includes your inputs and results, so anyone who opens it sees this exact calculation.
How This Calculator Works
A permutation (nPr) counts how many ways to arrange r items out of n where order matters, while
a combination (nCr) counts how many ways to choose r items out of n where order doesn’t matter.
Enter a total number of items (n) and how many you’re choosing (r), and this calculator finds both
related answers at once.
The Formulas
Permutations:P(n,r)=(n−r)!n! — equivalently, the
product of r descending numbers starting at n:
n×(n−1)×⋯×(n−r+1).
Combinations:C(n,r)=r!P(n,r) — the same
permutations count, divided by the r! ways those same r items could themselves
be reordered (since order doesn’t matter for a combination).
Worked Example
Choosing 3 items from a group of 10, where order matters (permutations):
P(10,3)=10×9×8=720
The same choice where order does NOT matter (combinations):
C(10,3)=720÷3!=720÷6=120
A Real-World Check
The odds of matching all 6 numbers in a 6-from-49 lottery draw are 1 in C(49,6) — exactly
13,983,816 — since the order the numbers are drawn in doesn’t change whether you’ve won.
Cómo funciona esta calculadora
Una permutación (nPr) cuenta de cuántas formas se pueden ordenar r elementos de un total de n
donde el orden importa, mientras que una combinación (nCr) cuenta de cuántas formas se pueden
elegir r elementos de un total de n donde el orden no importa. Ingresa un número total de
elementos (n) y cuántos estás eligiendo (r), y esta calculadora encuentra ambas respuestas
relacionadas a la vez.
Las fórmulas
Permutaciones:P(n,r)=(n−r)!n! — equivalentemente,
el producto de r números descendentes que comienzan en n:
n×(n−1)×⋯×(n−r+1).
Combinaciones:C(n,r)=r!P(n,r) — el mismo conteo de
permutaciones, dividido entre las r! formas en que esos mismos r elementos
podrían reordenarse entre sí (ya que el orden no importa en una combinación).
Ejemplo resuelto
Eligiendo 3 elementos de un grupo de 10, donde el orden importa (permutaciones):
P(10,3)=10×9×8=720
La misma elección donde el orden NO importa (combinaciones):
C(10,3)=720÷3!=720÷6=120
Una comprobación del mundo real
Las probabilidades de acertar los 6 números en un sorteo de lotería de 6 de 49 son 1 en C(49,6) —
exactamente 13,983,816 — ya que el orden en que se sortean los números no cambia si ganaste o
no.
What's the difference between a permutation and a combination?
A permutation counts arrangements where ORDER matters — 1st, 2nd, and 3rd place in a race are different outcomes even with the same three runners. A combination counts selections where order does NOT matter — a 3-person committee is the same group regardless of who was picked first.
Which one should I use for my problem?
Ask whether swapping the order of your selected items would count as a different outcome. If yes (arranging books on a shelf, assigning 1st/2nd/3rd place), use permutations. If no (picking a team, choosing lottery numbers, selecting a committee), use combinations.
Why is there a limit on how large n can be?
Permutations and combinations grow extremely fast — n! for even moderately large n produces numbers far beyond what can be represented exactly in JavaScript's number type. This calculator caps n at 1000 to keep results meaningful rather than silently returning an imprecise or infinite value.
We use cookies for analytics and ads to help support this free site. You can accept all, or decline and we'll only use what's needed for the site to work.