n choose k calculator n=112, k=3 result

Find out how many different ways you can choose k items from n items set without repetition and without order. This number is also called combination number or n choose k or binomial coefficient or simply combinations. See also general combinatorial calculator.

(n)
(k)

Calculation:

Ck(n)=(kn)=k!(nk)!n!  n=112 k=3  C3(112)=(3112)=3!(1123)!112!=321112111110=227920

The number of combinations: 227920

227920


A bit of theory - the foundation of combinatorics

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:

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

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 »