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:

Ck(n)=(nk)=n!k!(n−k)!  n=11 k=3  C3(11)=(113)=11!3!(11−3)!=11⋅10⋅93⋅2⋅1=165C_k(n) = \dbinom{ n}{ k} = \dfrac{ n! }{ k! (n-k)!} \ \\ \ \\ n = 11 \ \\ k = 3 \ \\ \ \\ C_{{ 3}}(11) = \dbinom{ 11}{ 3} = \dfrac{ 11! }{ 3!(11-3)!} = \dfrac{ 11 \cdot 10 \cdot 9 } { 3 \cdot 2 \cdot 1 } = 165

Number of combinations: 165