How it works and examples
Enter integers with 0 ≤ k ≤ n ≤ 1000. Combinations count unordered selections without replacement; permutations count ordered selections without replacement. Example: choosing 2 of 5 gives 10 combinations or 20 permutations. Results are exact; k=0 returns 1.