n choose k calculator n=1523, k=499 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=1523 k=499  C499(1523)=(4991523)=499!(1523499)!1523!4.904×10416

The number of combinations: 4.904565E+416

490456590329727935049278071956847158684250011404985850466
794339384756161749542602905059596754782560016743049668894817
598568517017674109734224689288699153915821563237866708479936
988383801618311762509389281857624788047296543219100613498520
761608776728258108089801672965303753518986976844755722760293
518499128624208525585988855146690153720575763795261934213143
548186004632907315548527024254361124774317178259243562393125


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 »