Scribd
Upload
597 views2 pages

Math Combinatorics

This document provides formulas and principles for combinatorics including: 1) Factorial, combination, and permutation formulas for counting arrangements of objects. 2) The binomial expansion formula and binomial theorem for expanding and calculating terms of (a + b)n. 3) Pascal's triangle used to calculate the coefficients in the binomial expansion. 4) The inclusion-exclusion principle for counting elements in a union of sets. 5) The complement principle relating a set and its complement within a universal set.

Uploaded by

Newton Linchen
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
597 views2 pages

Math Combinatorics

This document provides formulas and principles for combinatorics including: 1) Factorial, combination, and permutation formulas for counting arrangements of objects. 2) The binomial expansion formula and binomial theorem for expanding and calculating terms of (a + b)n. 3) Pascal's triangle used to calculate the coefficients in the binomial expansion. 4) The inclusion-exclusion principle for counting elements in a union of sets. 5) The complement principle relating a set and its complement within a universal set.

Uploaded by

Newton Linchen
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Combinatorics Formula Sheet

Factorial

factorial of a non-negative integer n : n!  n(n  1)(n  2) 3 2 1


special case : 0!  1

Combinations

n n!
n Different Objects Taken r Objects at a Time : Cr    
r ! (n  r )!
n
r

Permutations

n Different Objects : n!
n!
n Different Objects Taken r Objects at a Time : (1) Pr 
(n  r )!
n

(2) n Pr  n(n  1)(n  2) (n  r  1)


n!
n Objects Not All Different (Distinguishable P’s) :
n1 ! n2 ! n3 ! nk !
n Different Objects arranged in a Circle : (n  1)!

Binomial Expansion

1. The number of the terms in the expansion of (a  b)n is n  1 .


2. The coefficient of the first term is 1.
3. The coefficient of any other term is the product of the coefficient of the preceding term
and the exponent of a in the preceding term divided by the number of the preceding term.
4. The exponent of a in any term after the first term is one less than the exponent
of a in the preceding term. (The powers of a decrease from n to 0.)
5. The exponent of b in any term after the first term is one greater than the exponent
of b in the preceding term. (The powers of b increase from 0 to n .)
6. The sum of the exponents of a and b in each term is n .

BW – R0214
Binomial Theorem

n n n n n


(a  b)n    a n    a n  1 b1    a n  2 b2    a n  3 b3     bn
0 1  2  3  n

Alternate Form :

n
n n  r r n n!
( a  b) n
   a b where    n Cr 
r ! (n  r )!
r0 r r

k -th term Formula :

 n  n  ( k  1) k  1
k-th term of (a  b)n is  a b
 k  1

Row Pascal’s Triangle

0 1
1 1 1
2 1 2 1
3 1 3 3 1
4 1 4 6 4 1
5 1 5 10 10 5 1
6 1 6 15 20 15 6 1
7 1 7 21 35 35 21 7 1

The Inclusion-Exclusion Principle

For any two sets A and B , n ( A  B)  n ( A)  n ( B)  n ( A  B) .

The Complement Principle

If set A is a subset of a universal set U , then n ( A )  n (U )  n ( A C ) .

You might also like