Combinations without repetition

Find out how many different ways you can choose k items from n items set. With/without repetition, with/without order.

(n)
(k)

Calculation:

C_k(n) = {n choose k} = fraction{ n! }{ k! (n-k)!} ; ; C_{{ 11}}(11) = {{ 11} choose 11} = fraction{ 11! }{ 11!(11-11)!} = fraction{ 1 } { 1 } = 1 ; ;

Number of combinations: 1