Permutation without Repetition
For example: randomly take m numbers from n numbers (m<=n) without putting the numbers back and the sequence is important.
P(n,m)=n!(n−m)!
P
(
n
,
m
)
=
n
!
(
n
−
m
)
!
Combination without Repetition
For example: randomly take m numbers from n numbers (m<=n) without putting the numbers back and the sequence is not important.
C(n,m)=(nm)=n!m!(n−m)!
C
(
n
,
m
)
=
(
n
m
)
=
n
!
m
!
(
n
−
m
)
!