b2KIT

Combinatorics Calculator

Calculate permutations, combinations, factorials, and multinomial coefficients with visual counting diagrams and Pascal triangle.

Tested tool guide Tested browser tools Checked August 16, 2026

What Combinatorics Calculator does, with a checked example

Order is the decision that changes most answers in this calculator. Enter a total count and, where needed, a selection size or group sizes to evaluate factorials, permutations, combinations, and multinomial coefficients. Visual counting diagrams help distinguish arrangements from selections, while Pascal triangle shows how combination values relate. The most common mistake is using a permutation when rearranging the chosen items should not create a new outcome.

Worked example

A concrete input and expected output from the current implementation.

Input

Combination: n = 5, r = 2

Expected output

10

Choosing 2 items from 5 without regard to order gives C(5,2) = 5! / (2! * 3!) = 10. Each pair is counted once, so AB and BA are the same selection.

How the result is produced

1

Choose the counting model

Factorial counts orderings of all n distinct items: n!. A permutation counts ordered selections using n! / (n-r)!, while a combination counts unordered selections using n! / (r!(n-r)!). These formulas use nonnegative integer counts, and 0! equals 1. Changing whether order matters can therefore change the result substantially.

2

Read the visual views

The counting diagrams provide a visual interpretation of possible choices or arrangements. Pascal triangle presents binomial coefficients, with the entries in row n corresponding to C(n,0) through C(n,n) when the top is labeled row 0. Adjacent entries also satisfy C(n,r) = C(n-1,r-1) + C(n-1,r).

Good uses

  • Count how many ordered podium results are possible when three finalists are selected from a larger field.
  • Find the number of committees, card selections, or item subsets when the order of selection does not matter.
  • Calculate distinct arrangements of a word or collection containing specified counts of repeated item types.

Limits and checks

  • Standard permutation and combination formulas treat the original items as distinct and selection as being without replacement.
  • A multinomial calculation requires category sizes whose sum equals the total number of items being arranged.
  • Pascal triangle rows may be numbered from 0 or 1 elsewhere, so identify the displayed row labels before comparing entries.

Common questions

Should I use a permutation or a combination?

Use a permutation when changing the order creates a different result, such as first, second, and third place. Use a combination when only membership matters, such as choosing three committee members. For n = 5 and r = 2, permutations give 20 ordered pairs, while combinations give 10 unordered pairs.

Does a multinomial coefficient handle repeated objects?

Yes, when the multiplicity of each object type is specified. For group sizes k1 through km totaling n, the count is n! divided by k1! through km!. This counts distinct arrangements of a fixed multiset. It does not by itself model unrestricted repeated selection, where an item may be chosen again any number of times.

References and verification

The example and behavioral notes were checked against the browser implementation. Standards and primary references below define the relevant format, formula, or platform behavior.

Related Tools