N Choose K Calculator n=13983816, k=50 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=13983816 k=50  C50(13983816)=(5013983816)=50!(1398381650)!13983816!6.283×10292

The number of combinations: 6.2830732852259×10292

62830732852259399099377078831375428691940717865928821
754896950285640366320917808768359358203216930575351140943974
569529684799991482569357651958876317846484509151972300828874
621005465820658921508066209180270916807899656556394019484650
057384150215787100472190165978435597372495563715338172598736


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 »