n!

P ( n , m) =
( n−m ) !
P (n , m)
m()
C ( n , m )= n =
m!
=
n!
m ! ( n−m) !

(mn )=( n−m

n
)
Pascal’s Identity:

(m−1 ) ( m) ( m )
n + n = n+1

Binomial Theorem:
n
n n 0
( x + y ) =C 1 x y +C 2 x n−1
y + … … .= ∑
1

i+ j=n
( )
n x i y j=
i, j
∑
i =0 i
()
n xi y n−i

Multinomial Theorem:

∑ ( n
)
n i i i
( x 1 + x2 + … x m ) = x1 x2 … . xm
1 2 m

i 1+i 2+, ..i m =n i 1 ,i 2 , ..i m

∑ x i=n , x i ≥ 1 ,

number of ways ¿ get the ∑ ¿ n−1

m−1 ( )
∑ x i=n , x i ≥ 0 ,

number of ways ¿ get the ∑ ¿ n+m−1

m−1 ( )
((mn ))=(n+m−1
m−1 ) ( n )
= n+ m−1

Inclusion Exclusion Principle:

n
A1 ∪ A 2 ∪ …∪ A n= n
1 ( ) ∑ A −(n2) ∑ A ∩ A +(n3 ) ∑ A ∩ A ∩ A …
i=1
i
i≠ j
i< j
i j
i< j<k
i j k

Euler’s φ function: # of de-arrangement (# of all numbers in different position)

( p1 )
N
φ n=n ∏ 1−
i=1 i

# of de-arrangement (# of all numbers in different position)

 n n n
n! n!
d n=∑ (−1 ) =∑ (−1 ) =∑ (−1 ) ⋅ P( n , j)
n n− j n−j

i=0 i! j=0 ( n− j) ! j=0

In general, If | A|=n ,∧|B|=m, then,

n
¿ of maps ( A , B ) =m

|inj ( A , B )|=P ( m ,n )
m m
surj ( n ,m )=∑
i=0
()
m ( m−i )n (−1 )i=
i
∑ ( )
m j n (−1 )m− j
i=0 m− j

Bij ( A , B )=P ( n , n )=n!