Assignment # 2 MTH202 (Fall 2017)

Name: Shaid Nadeem Total Marks: 15

Student ID: BC160400654 Due Date: 25 -01-2018

DON’T MISS THESE: Important instructions before attempting the solution of

this assignment:
• To solve this assignment, you should have good command over 29-34
lectures.
• Upload assignments properly through LMS, No Assignment will be accepted
through email.
• Write your ID on the top of your solution file.
 Don’t use colorful back grounds in your solution files.
 Use Math Type or Equation Editor etc for mathematical symbols.
 You should remember that if we found the solution files of some students are
same then we will reward zero marks to all those students.
 Make solution by yourself and protect your work from other students,
otherwise you and the student who send same solution file as you will be
given zero marks.
 Also remember that you are supposed to submit your assignment in Word
format any other like scan images etc will not be accepted and we will give
zero marks correspond to these assignments.

Question: 1 Marks: 10

Show that
n
P3  n P2  n P1  n3  2n 2  2n for all integers n  3
SOLUTION
L.H .S  P3  P2  P1
n n n

n! n! n!
  
(n  3)! (n  2)! (n  1)!
n(n  1)(n  2)(n  3)! n(n  1)(n  2)! n(n  1)!
  
(n  3)! (n  2)! (n  1)!
That can be simplified to form:
 n(n  1)(n  2)  n(n  1)  n
 n(n 2  3n  2)  n 2  n  n
 n3  3n 2  2n  n 2
 n 3  2n 2  2n
This is actually our R.H.S
Hence proved that:
n
P3  n P2  n P1  n3  2n 2  2n for all integers n  3
Question: 2 Marks: 05

Suppose that 250 faculty members can speak French (F) and 60 can speak Russian (R),
while only 10 can speak both French and Russian. Using Inclusion-exclusion Principle
find how many faculty members can speak either French or Russian?

SOLUTION
Let the faculty members that can speak French = n (F) = 250
Let the faculty members that can speak Russian = n(R) = 60
Let the faculty members that can speak both Russian and French = n( F  R ) =10
Let the faculty members that can speak either Russian or French= n( F  R ) =?
Now by INCLUSION EXCLUSION PRINCIPLE:
We know that for finite sets A and B:

n( A  B)  n( A)  n( B)  n( A  B )

In our case it will be like:

n( F  R )  n ( F )  n( R )  n( F  R )

Now by putting values we have:

n( F  R)  250  60  10
n( F  R)  300

So the facility members that can speak either Russian or French = 300