N Choose K calculator n=111, k=10 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.Calculation:
Ck(n)=(kn)=k!(n−k)!n! n=111 k=10 C10(111)=(10111)=10!(111−10)!111!=51540966982791
The number of combinations: 51540966982791
51540966982791
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!(n−k)!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
- Family
What is the probability that a family with 3 children has: exactly 1 girl? 2 girls and 1 boys? Consider the birth probability of a girl as 48.66% and a boy as 51.34%. - Dice
How many times must you throw the dice, and was the probability of throwing at least one pětky greater than 70%? - Seating
How many ways can 7 people sit on 5 numbered chairs (e.g., seat reservation on the train)? - Playing cards
How many possible ways are there to shuffle 6 playing cards? - Chess
How many ways can you select 4 fields on a classic chessboard with 64 fields so that fields don't have the same color?
more math problems »
