Combinations and Permutations Calculator
Free online Combinations and Permutations Calculator that runs directly in your browser.
-
1Enter data
Enter content, paste text or load a file from disk. -
2Click the button
The tool will immediately process your data in the browser. -
3Get the result
Copy the finished text or save the file to your device.
return "Result ready in 0.1s";
}
The result is recalculated automatically with each change.
Show full summary and explanation
Combination and permutation calculator -------------------------------------- Typ: Kombinacja (n po k) n = 10, k = 3 Repetitions:No Pattern:C(n, k) Number of digits of the result:3 Result:120 How to interpret this result ---------------------- The order does not matter and the elements are not repeated. What counts is the number of different k-element subsets selected from n elements. Definicja: C(n, k) = n! / (k!(n-k)!). Tip: If replacing two selected items changes the result, use permutation. If it doesn't change - use a combination.
Rate this tool:
Related tools
Other tools you may find usefulCombinatorics and permutations calculator - foundations of combinatorics
Combinatorics is a fascinating branch of mathematics dealing with the study of discrete structures, i.e. determining the number of possible arrangements, choices or assignments of elements from finite sets. We encounter its concepts in probability theory, statistics, cryptography, and even in games of chance (e.g. Lotto) or logistic planning. Two basic concepts of combinatorics that we often confuse in everyday language are combinations and permutations. They differ fundamentally in the role played by the order of selected elements. Our combination and permutation calculator is a free tool that allows you to instantly calculate both values and variations, along with the presentation of mathematical formulas.
Regardless of whether you are solving your math homework, designing an IT algorithm, or want to calculate your chances of winning the lottery - our calculator will make it easier for you. Just enter the size of the base set (\(n\)) and the number of selected elements (\(k\)), and the system will present the exact result along with intermediate calculations and factorial.
Summary of the main combinatorial concepts and their formulas
To solve a combinatorial problem correctly, you must first answer two questions: "Does the order of the elements matter?" and “Can elements be repeated?” The table below organizes these concepts:
| Concept name | Does the order matter? | Can elements be repeated? | Mathematical formula | Practical example |
|---|---|---|---|---|
| Combinations without repetitions | No | No | \(C_n^k = \binom{n}{k} = \frac{n!}{k!(n-k)!}\) | Drawing 6 numbers out of 49 in the Lotto game. |
| Permutations without repetitions | Yes (set all elements) | No | \(P_n = n!\) | Putting 5 people in line at the cash register. |
| Variations without repetitions | Yes (select and arrange the part) | No | \(V_n^k = \frac{n!}{(n-k)!}\) | Selection of the podium (1st, 2nd, 3rd place) from a group of 10 runners. |
| Variations with repetitions | Yes | Yes | \(W_n^k = n^k\) | Create a 4-digit bank card PIN. |
| Repeat combinations | No | Yes | \(\bar{C}_n^k = \binom{n+k-1}{k}\) | Selection of 5 scoops of ice cream from 10 available flavors. |
The main differences between combination and permutation
Understanding the difference between these two concepts is the key to avoiding cardinal mathematical errors:
- Combination (The order does NOT matter):We are only interested in what items were selected, not in what order they fell into our basket. For example, if you are choosing a 3-person delegation from a class of 10, the choice: {Ania, Bartek, Czarek} is exactly the same choice as: {Czarek, Ania, Bartek}. We then use Newton's symbol.
- Permutation (Order MATTERS):We focus on organizing or mixing the entire collection. The number of permutations corresponds to the number of possible arrangements of elements. For example, we can arrange 3 books on a shelf in 6 different ways (\(3! = 3 \times 2 \times 1 = 6\)). Each change in arrangement is a new permutation.
How to calculate factorial and combinations step by step?
The basis of most combinatorial formulas is the factorial (marked with an exclamation mark "!"). The factorial of a natural number is the product of all positive integers less than or equal to that number:
- Understanding factorial:By definition, \(n! = 1 \times 2 \times 3 \times ... \times n\). Additionally, it is assumed that \(0! = 1\). For example: \(5! = 1 \times 2 \times 3 \times 4 \times 5 = 120\).
- Calculating combinations without repetitions \(\binom{n}{k}\):Suppose we want to calculate the number of ways to choose 2 cards from a deck of 5 cards (\(n=5, k=2\)).
- Writing the formula:We insert the data into the formula: \(\binom{5}{2} = \frac{5!}{2!(5-2)!} = \frac{5!}{2! \times 3!}\).
- Reducing the factorial (a very important step to facilitate calculations):We write the numerator so as to reduce it with a larger factorial in the denominator: \(\frac{5 \times 4 \times 3!}{2! \times 3!} = \frac{5 \times 4}{2!} = \frac{20}{2} = 10\). There are exactly 10 such combinations.
Frequently Asked Questions (FAQ)
What is the difference between a combination and a variation?
In a combination, the order of the elements in the subset does not matter (e.g. choosing fruit for a salad). In a variation, the order is crucial (e.g. the choice of digits in a safe code). Selecting the digits {1, 2} gives the same combination, but two different variations: 12 and 21.
What is the factorial of zero (0!) and why is it not 0?
The factorial of zero is exactly 1 (\(0! = 1\)). This is due to the mathematical definition and the consistency of the combinatorial formulas. If \(0!\) was 0, division by zero would make it impossible to calculate, for example, the combination \(\binom{n}{n}\) - that is, the selection of all elements from the set, which can only be done in one way.
What is the probability of winning "six" in Lotto?
The Lotto game involves drawing 6 numbers out of 49 without repetitions and without any order (combination). The number of possible combinations is \(\binom{49}{6} = 13\ 983\ 816\). This means that the chance of hitting the jackpot with one bet is exactly 1 in nearly 14 million.
Can your calculator handle very large numbers?
Yes. Our calculator uses special algorithms for precise arithmetic calculations (BigInt or high-precision floating-point numbers), which allows for error-free calculation of factors and combinations even for very large sets that exceed standard browser memory limits.
What is Pascal's triangle and how does it relate to combinations?
Pascal's triangle is a triangular array of numbers in which each element at the edges is 1 and the remaining elements are the sum of the two numbers immediately above it. The subsequent numbers in the rows of Pascal's triangle correspond to the values of Newton's symbols (combinations) for subsequent degrees \(n\), which allows for their quick determination without using a factorial.