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).

(n)
(k)

Calculation:

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

Combinations

A combination of the 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 the order does not matter. In mathematics, such unordered groups are called sets and subsets. The count is called a combination number and is calculated as follows:

Ck(n)=(kn)=k!(nk)!n!

A typical example: we have 15 students and need to choose 3. How many ways can this be done?

Foundation of combinatorics in word problems



more math problems »