Order no · Repetition no
Combination without repetition
Use it to form groups where each element appears at most once. Example: choosing a committee.
Answer two questions about order and repetition to choose the correct formula and obtain an exact integer result.
You do not need to memorize the formula. Indicate what changes a solution and the calculator will identify the case.
C(n, k) = n! / (k! × (n − k)!)
The substitution will appear after a valid calculation.
The calculator's two questions correspond to these four cases.
Order no · Repetition no
Use it to form groups where each element appears at most once. Example: choosing a committee.
Order yes · Repetition no
Use it when positions are distinct and no element can repeat. Example: gold, silver and bronze.
Order no · Repetition yes
Use it to choose quantities where an option can appear several times. Example: scoops of ice cream by flavor.
Order yes · Repetition yes
Each position can use any option. Example: a PIN or a fixed-length password.
Each example activates a different combination of order and repetition.
Choose 3 people from 10 when order does not change the group.
n = 10, k = 3
Assign gold, silver and bronze among 10 participants without repetition.
n = 10, k = 3
Choose 3 scoops from 5 flavors, allowing flavors to repeat.
n = 5, k = 3
Create a 4-position PIN using 10 digits that can repeat.
n = 10, k = 4
Many combinatorial operations quickly exceed JavaScript's safe number range. This tool calculates with BigInt integers. Scientific notation only summarizes the display; the exact result remains available to view and copy.
In a combination, order does not change the result. In a permutation or arrangement, changing the order creates a different result. Choosing Ana and Luis for a committee is the same selection as Luis and Ana; assigning them first and second place is not.
Ask whether swapping two elements produces a different result. If it changes a podium, password or assignment of positions, order matters. If the final group stays the same, it does not.
It means the same option can be used more than once. Digits can repeat in a PIN; one person cannot occupy two places on a podium.
Without repetition, you cannot choose more elements than are available. With repetition, it may be valid because an option can be used several times.
The number of possibilities grows very quickly. The calculator preserves the exact integer with BigInt, shows a compact view and lets you copy every digit.
n^k counts sequences of k positions with n options at each position. Ordering a set that already contains repeated elements, such as the letters in MAMA, requires another formula and is outside this calculator's scope.