±Free
Combinations and permutations
Count unordered selections and ordered arrangements without repetition.
Enter the available item count n and the selected count k. The tool returns combinations C(n,k), where order does not matter, and permutations P(n,k), where order matters, using integer arithmetic.
How to use
- Enter your text, values, or image.
- Adjust the options and run the tool.
- Copy or download your result.
Worked example
Example input
Available items n: 5 Selected items k: 2
Example result
{
"combinations": "10",
"permutations": "20"
}Limitations and details
n and k must be integers with 0 ≤ k ≤ n ≤ 2000; repeated selections are not included.
Inputs and options
- Available items n
- Number · Minimum: 0 · Maximum: 2000
- Selected items k
- Number · Minimum: 0 · Maximum: 2000
Frequently asked questions
Is this tool free and private?
Yes. All 300 tools are free in this phase. Processing happens in your browser; your input and files are not sent to our servers.