Combinatorial calculator

Find out how many different ways you can choose k items from n items set. With/without repetition, with/without order.

Calculation:

C_{k} (n) = (k n) = \frac{n !}{k ! ( n - k ) !} n = 10 k = 4 C_{4} (10) = (4 1 0) = \frac{1 0 !}{4 ! ( 1 0 - 4 ) !} = \frac{1 0 \cdot 9 \cdot 8 \cdot 7}{4 \cdot 3 \cdot 2 \cdot 1} = 210

The number of combinations: 210

A bit of theory - the foundation of combinatorics

Variations

A variation of the k-th class of n elements is an ordered k-element group formed from a set of n elements. The elements are not repeated and depend on the order of the group's elements (therefore arranged).

The number of variations can be easily calculated using the combinatorial rule of product. For example, if we have the set n = 5 numbers 1,2,3,4,5, and we have to make third-class variations, their V₃ (5) = 5 * 4 * 3 = 60.

V_{k} (n) = n (n - 1) (n - 2) . . . (n - k + 1) = \frac{n !}{( n - k ) !}

n! we call the factorial of the number n, which is the product of the first n natural numbers. The notation with the factorial is only clearer and equivalent. For calculations, it is fully sufficient to use the procedure resulting from the combinatorial rule of product.

Permutations

The permutation is a synonymous name for a variation of the nth class of n-elements. It is thus any n-element ordered group formed of n-elements. The elements are not repeated and depend on the order of the elements in the group.

P (n) = n (n - 1) (n - 2) . . . 1 = n!

A typical example is: We have 4 books, and in how many ways can we arrange them side by side on a shelf?

Variations with repetition

A variation of the k-th class of n elements is an ordered k-element group formed of a set of n elements, wherein the elements can be repeated and depends on their order. A typical example is the formation of numbers from the numbers 2,3,4,5, and finding their number. We calculate their number according to the combinatorial rule of the product:

V_{k}^{'} (n) = n \cdot n \cdot n \cdot n . . . n = n^{k}

Permutations with repeat

A repeating permutation is an arranged k-element group of n-elements, with some elements repeating in a group. Repeating some (or all in a group) reduces the number of such repeating permutations.

P_{k_{1} k_{2} k_{3} . . . k_{m}}^{'} (n) = \frac{n !}{k _{1} ! k _{2} ! k _{3} ! . . . k _{m} !}

A typical example is to find out how many seven-digit numbers formed from the numbers 2,2,2, 6,6,6,6.

Combinations

A combination of a k-th class of n elements is an unordered k-element group formed from a set of n elements. The elements are not repeated, and it does not matter the order of the group's elements. In mathematics, disordered groups are called sets and subsets. Their number is a combination number and is calculated as follows:

C_{k} (n) = (k n) = \frac{n !}{k ! ( n - k ) !}

A typical example of combinations is that we have 15 students and we have to choose three. How many will there be?

Combinations with repeat

Here we select k element groups from n elements, regardless of the order, and the elements can be repeated. k is logically greater than n (otherwise, we would get ordinary combinations). Their count is:

C_{k}^{'} (n) = (k n + k - 1) = \frac{( n + k - 1 ) !}{k ! ( n - 1 ) !}

Explanation of the formula - the number of combinations with repetition is equal to the number of locations of n − 1 separators on n-1 + k places. A typical example is: we go to the store to buy 6 chocolates. They offer only 3 species. How many options do we have? k = 6, n = 3.

Foundation of combinatorics in word problems

Chess
How many ways can you select 4 fields on a classic chessboard with 64 fields so that fields don't have the same color?