Combinations calculator

The calculator finds the number of combinations of the k-th class from n elements without repetition. A combination with repetition of k objects from n is a way of selecting k objects from a list of n. The order of selection does not matter and each object can be selected once (without repeated).



Ck(n)=(kn)=k!(nk)!n!  n=10 k=4  C4(10)=(410)=4!(104)!10!=432110987=210

The number of combinations: 210

A bit of theory - the foundation of combinatorics


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:


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

Foundation of combinatorics in word problems

more math problems »