0% found this document useful (0 votes)
21 views

W7 Working with Combinations and Permutations Formulae Soln

Uploaded by

Anujan
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
0% found this document useful (0 votes)
21 views

W7 Working with Combinations and Permutations Formulae Soln

Uploaded by

Anujan
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

W7 Working with Combinations and Permutations Formulae NO CAS

nC !
Combinations (when order is not important) r
! !

If we are doing a task involving combinations without a calculator, or answering a


“show that” question it can be necessary to work this out by hand.
Things to remember:
Simple cases: nC
1 𝑛 nC
n 1 nC
0 1
Examples: 5C
1 5 5C
5 1 5C
0 1

Relationships: nC nC Examples: 5C2 5C 11C 11C Think about why!


r n‐r 3 7 4

1. Evaluate
a) 8C
1 8 b) 8C7 =8 C 1 = 8 c) 11C
1 11 d) 11C
10 =11C1 = 11
nP 𝒏!
Permutations (when order is important) r
𝒏 𝒓 !

(permutations questions are often easier to do without using formula)


nC !
Combinations (when order is not important) r
! !

In order to simplify these by hand we can manipulate the factorial expressions


Simplifying Factorials: Try to write the numerator (top) and denominator
(bottom) of the fraction in terms of the same factorial so you can cancel.
! 𝟔!
e.g. 56
! 𝟔!

1. Evaluate
! 𝟕! ! 𝟗!
a) b) 𝟗!
! 𝟕! !
72 1320

! !
c) 7C
4 35 d) 7C
3 7C
4
! ! ! !
35

e) 10C ! ! e) 10C 10C


8
45 2 2
! ! ! !
45
F. Mahoney
!
Working with pronumerals: e.g. Simplify
!

…..
!
!
!

𝑘 𝑘 1 𝑘 2
2. Simplify
! nP ! !
a) ! b) 3
! ! ! 𝒏 𝟑 !

𝑛 𝑛 𝑛 1 𝑛 2
OR think about “filling 3 places:
𝑛 𝑛 1 𝑛 2

c) nC
n‐2 ! d) nC
n‐3 !
! ! ! !
! !
! ! ! !
! !
! ! ! !

If P9  72  P7 , where n  7 , show algebraically that the only possible value


n n
3.
of n is n  16 .
n! n!
 72 
(n  9)! (n  7)!
n!(n  7)!  72n!(n  9)!
(n  7)! OR
 72 n(n  1)(n  2)(n  3)(n  4)(n  5)(n  6)(n  7)(n  8)  72n(n  1)( n  2)(n  3)( n  4)(n  5)(n  6)
(n  9)!
(n  7)(n  8)(n  9)! (n  7)( n  8)  72
 72
(n  9)! (n  7)( n  8)  72
(n  7)(n  8)  72 then as per other soln
n2  15n  56  72
n2  15n  16  0
(n  1)(n  16)  0
n  1, 16
n  1 (infeasible b/c n>7)
 n  16

F. Mahoney

You might also like