0% found this document useful (0 votes)
14 views40 pages

P and C

MATHS CLASS 11

Uploaded by

vickykaoppo
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)
14 views40 pages

P and C

MATHS CLASS 11

Uploaded by

vickykaoppo
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

9/13/25, 8:12 PM Smart Notebook Viewer and Reader

[Link] 1/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

(i)Repetition of the digits is allowed D3 D2 D1


Let the three digit number be of the form D 3 D2 D1 .where
D1 , D2 and D3 denote the digit at units place, tens place & Hundreds place respectively
Number of digits available (ie 1,2, 3, 4 & 5) = 5
Number of ways of filling D1 ,using one of the five digits = 5
Since Repetition of the digits is allowed , hence
[Link] 2/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

number of ways of filling D2 ,using one of the 5 digits = 5.


Similarly,
number of ways of filling D3 ,using one of the 5 digits = 5.
Therefore, By Fundamental principle of Counting,
Total number of 3 digit numbers which can be formed using the
given digits = 5 x 5 x 5 = 125

(ii)Repetition of the digits is not allowed


Number of ways of filling D1 ,using one of the five digits = 5
Since Repetition of the digits is not allowed , hence
number of ways of filling D2 ,using one of the Remaining 4 digits = 4.
Similarly,
number of ways of filling D3 ,using one of the Remaining 3 digits = 3.
Therefore, By Fundamental principle of Counting,
Total number of 3 digit numbers which can be formed using the
given digits = 5 x 4 x 3 = 60

Let the three digit even number be of the form D 3 D2 D1 .where D3 D2 D1


D1 , D2 and D3 denote the digit at units place, tens place & hundreds place respectively
Number of digits available (ie 1,2, 3, 4 5 & 6) = 6
Since the units digit of Even number can be 2 , 4 , 6
Number of ways of filling D1 ,using one of the 3 digits ( ie 2 4, 6 ) = 3
Since Repetition of the digits is allowed , hence
number of ways of filling D2 ,using one of the 6 digits = 6.
Similarly,
number of ways of filling D3 ,using one of the 6 digits = 6.
Therefore, By Fundamental principle of Counting,
Total number of 3 digit even numbers which can be formed using the
given digits = 3 x 6 x 6 = 108

Let the 4-Letter code number be of the form L4 L 3 L2 L1 .where


[Link] 3/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

L4 , L3, L2 ,L1 denote the first, second, third & fourth letters respectively
Number of alphabets available = 10
Number of ways of filling L1 ,using one of the 10 Letters = 10
Since Repetition of the letters is not allowed , hence
number of ways of filling L2 ,using one of the Remaining 9 letters = 9.
Similarly,
number of ways of filling L3 ,using one of the Remaining 8 digits = 8.
number of ways of filling L4 ,using one of the Remaining 7 digits = 7.
Therefore, By Fundamental principle of Counting,
Total number of 4 letter codes which can be formed using the
given 10 letters = 10 x 9 x 8 x 7 = 5040

Let the 5 Digit Telephone number starting with 67 be of the form 6 7 D 3 D2 D1 .where
D1 , D2 and D3 denote the digit at units place, tens place & hundreds place respectively
Number of digits available (ie 0, 1, 2 ,3,4, 5 ,6 ,7, 8 ,9)= 10

Since The number starts with 67 and 6 7 D3 D2 D1


Repetition of the Digits is not allowed , hence
number of ways of filling D3 ,using one of the Remaining 8 digits(other than 6& 7) = 8
Similarly,
number of ways of filling D2 ,using one of the Remaining 7 digits = 7.
number of ways of filling D1,using one of the Remaining 6 digits = 6.
Therefore, By Fundamental principle of Counting,
Total number of 5 digit telephone numbers starting with 67
which can be formed using the given 10 digits = 8 x 7 x 6 = 336

When a Coin is tossed , there are two possible outcomes, head & Tail .
Number of possible outcomes when the coin is tossed First time = 2
Number of possible outcomes when the coin is tossed Second time = 2
Number of possible outcomes when the coin is tossed Third time = 2
[Link] 4/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

Therefore, By Fundamental principle of Counting,


Total number of possible outcomes when the coin is tossed 3 times= 2 x 2 x 2 =8

Since to generate a Signal , we require 2 Flags of different colours .


Number of ways of selecting First flag out of given 5 different flags = 5
After Selecting First flag ,
Number of ways of selecting second flag out of remaining 4 different flags = 4
Total number of different signals that can be generated using 2 flags of
different colour
= Total number of ways of selecting 2 flags out of 5 different coloured flags
= 5 x 4 = 2 0 B y Fundamental principle of Counting,

1 Page

[Link] 5/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

[Link] 6/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

If n is any natural number , then the product of first n natural numbers is

denoted by n ! read as " Factorial n" Or n

=2
=6
24 =

=120

[Link] 7/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

Particular cases
(1)

(2)

[Link] 8/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

Particular case :If r = n

2 Page

[Link] 9/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

[Link] 10/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

= 8 x 7 x6 x 5x 4 x3 x 2x1
= 8 x 7 x 720 = 40320

= 4 x3 x 2x 1-- 3 x2 x 1
= 24 -- 6 = 18

x=

[Link] 11/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

3 Page

[Link] 12/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

Number of digits available (ie 1, 2, 3, 4 5 , 6 ,7 ,8 & 9 ) = 9


No of digits required to form a 3 digit number = 3
Since Repetition of the digits is not allowed,
Total number of 3 digit numbers which can be formed using the
given digits = Total no of permutations i.e arrangements of 9 digits taken 3 at a time without
repetition= 9 P3=

Number of digits available (ie 0 ,1, 2, 3, 4 5 , 6 ,7 ,8 & 9 ) = 10


No of digits required to form a 4 digit number = 4
Since a 4 digit number can never start with a Zero , therefore the number of ways of filling the
thousands digit using one of 9 non zero digits = 9
Since Repetition of the digits is not allowed, the remaining 3 places can be filled & arrang
using remaining 9 digits (including 0) in 9 P 3 ways
Total number of 4 digit numbers which can be formed using the

given digits = 9 X 9 P3= 9 X 504 = 4536

9 P3=

Number of digits available (ie 1, 2, 3, 4 6 ,7 ) = 6


No of digits required to form a 3 digit even number = 3
Since a 3 digit even number can have 2 , 4 or 6 at the units place ,
therefore the number of ways of filling the
units digit using one of 3 digits (ie 2 4 or 6 )= 3
[Link] 13/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader
units digit using one of 3 digits (ie 2 , 4 or 6 )= 3
Since Repetition of the digits is not allowed, the remaining 2 places can be filled & arrange
using remaining 5 digits in 5 P2 ways
Total number of 3 digit even numbers which can be formed using the

given digits = 3 X 5 P2 =

Total number of 4 digit numbers possible using the given 5 digits


without repetition = 5 P 4 = 5 ! / 1! = 5 ! = 120
since an number can end with a 2 or 4 ,
hence the unit digit can be filled in 2 ways.
furthur the remaining 3 places can be filled from remaining 4
numbers in 4 P 3 = 4 ! = 24 ways
Hence total number of even numbers = 2 X 24 = 48

No of persons in the Committee = 8


No of persons to be selected = 2
Since one person can not hold more than 1 position,
[Link] 14/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

therefore , total no of ways of choosing a chairman & a vice


chairman out of committee of 8 persons = 8P2

otherwise
n
p4 is not defined

n=9

[Link] 15/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

The word EQUATION has 8 letters in which each letter appears exactly
once.
Hence total number of words which can be formed using all the 8 letters
of the given word exactly once = Total no of permutations ie
arrangements of 8 letters taking all 8 at a time without repetition =

[Link] 16/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

The word MONDAY has 6 letters in which each letter appears exactly
once & there are two vowels and Four consonants
Hence total number of words which can be formed using 4 letters
of the given word exactly once = Total no of permutations ie
arrangements of 6 letters taking 4 at a time without repetition =

Total number of words which can be formed using all the 6 letters of the
given word exactly once = Total no of permutations ie arrangements of 6
letters taking all 6 at a time without repetition 6
6 = P = 720

Since there are two vowels ie (O & A),Hence the first letter can be
filled using one of the vowels in 2 ways .After filling the first letter, the
remaining 5 places can be filled and arranged using the remaining 5
letters(including the 1 left vowel) in 5 ! ways
Total number of words which can be formed using all letters exactly once
and first letter is a vowel = 2 X 5 ! =2 X 120 =240

The word MISSISSIPPI has 11 letters in which letters S & I appear 4 times each
and letter P appears twice & M appears exactly once .
Total number of distinct permutations using all 11 letters
o f t h e g i v e n w o r d w i t h o u t a n y r e s t r i c t i o n = 11 !

4 ! X
[Link] 4 ! 2 ! 17/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader
4 ! X 4 ! x 2 !
If all the 4 I s always come together
then consider all 4 I"s as one single letter , the total 8 letters (ie 1 letter of 4 I 's
& remaining 7 letters) can be arranged in 8 ! . ways

4 !x2!
Hence total number of distinct permutations when 4 I do not come together
= total number of distinct permutations using all 11 letters
of given word without any restriction---- total number of distinct permutations
using all 11 letters when all 4 I s always come together

= 35 X 966 = 33810

4 Page

[Link] 18/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

[Link] 19/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

last question 11

The word PERMUTATIONS has 12 letters in which there are 7 consonants and
5 vowels and letter T appears twice & other letters appear exactly once

If all the 5 Vowels always come together


then consider all 5 vowels as one single letter , the total 8 letters (ie 1 letter of 5
vowels & remaining 7 letters) can be arranged in 8 ! / 2! w a y s
Furthur the group of 5 vowels can be arranged among themselves in 5! ways

Hence total number of distinct permutations when all 5 Vowels come together
=

= 40320 x 60 = 2419200

If the word starts with P & ends with S, then the remaining 10 letters
can be arranged in the 10 vacant positions in 10 ! / 2 ! ways.
Therefore total no of arrangements which start with P & end with S =

= 45X 40320 = 1814400

If there are always 4 letters between P & S, then it can be


[Link] 20/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

possible in any of the following ways :-


P & S occupy 1st & 6 th positions respectively
P & S occupy 2nd & 7 th positions respectively
P & S occupy 3rd & 8 th positions respectively
P & S occupy 4 th & 9 th positions respectively
P & S occupy 5 th & 10 th positions respectively
P & S occupy 6 th & 11 th positions respectively
P & S occupy 7th & 12 th positions respectively
Furthur
P & S can interchange their positions ie can be arranged in 2
ways.

After fixing the positions of P & S, then the remaining 10 letters can
be arranged in the 10 vacant positions in 10 ! / 2 ! ways.
Hence total no of arrangements of the given word such that there are
exactly 4 letters between P & S = 7 X 2 X 10 ! / 2 !
= 7 X 1 0 X 9 X ( 8 ! ) = 6 3 0 X 4 0 3 2 0 = 25401600

[Link] 21/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

Relation between nPr & nCr

1)

2)

[Link] 22/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

5 Page

[Link] 23/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

[Link] 24/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

Page 153

Given

Since

[Link] 25/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader
n
C3 is defined
only if n ≥ 3.

Since a chord is obtained by joining any 2 points


on the circle, therefore number of chords which
can be drawn through 21 points on a circle=
No of ways of selecting 2 points out of 21 points
= 21 C 2 = 21 X 20 / 2 = 210

[Link] 26/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

No of ways of selecting 3 boys out of 5 Boys


= 5 C 3= 5
C 2 =5 X 4 / 2 = 10
No of ways of selecting 3 Girls out of 4 Girls
= 4 C 3= 4
No of ways of selecting 3 boys & 3 Girls out of 5
Boys & 4 Girls =10 X 4 = 40

In a deck of 52 cards there are 4 aces and 48 non ace cards.


No of ways of selecting one ace out of 4 aces = 4C1 = 4.
No of ways of selecting 4 Non ace Cards out of 48 Non ace
cards = 48 C 4 = .

[Link] 27/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

778320

Total number of players is 17 in which there are 5 bowlers & 12


non bowlers.
To select 11 players out of which there are 4 bowlers & 7 non
bowlers.
Number of ways of selecting 4 bowlers out of 5 bowlers = 5C 4
Number of ways of selecting 7 non bowlers out of 12 non bowlers
= 12C 7
Hence total number of ways of selecting a team of 11 players
with 4 bowlers & 7 non bowlers = 5C 4 X 12C 7 =

Number of courses available = 9


o t of hich there are 2 comp lsor & 7 non
[Link] 28/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader
out of which there are 2 compulsory & 7 non
compulsory courses

since 2 specific courses are compulsory ,& 5 are to


be selected hence the remaining 3 courses can be
selected out of remaining 7 non compulsory
courses in 7 C 3 = 7 X 6 X 5 / 6 =35ways

6 Page

[Link] 29/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

[Link] 30/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

The word DAUGHTER has 8 letters in which there are 3 vowels (ie A, E , U )
and 5 Consonants (ie D, G,H, T& R) & each letter appears exactly once.
No of ways of selecting 2 Vowels out of 3 Vowels = 3 C 2= 3
No of ways of selecting 3 Consonants out of 5 Consonants = 5 C 3= 5 C 2

= 5 X 4 / 2 = 10
Furthur, the total 5 letters( 3 Consonants & 2 Vowels) can be arranged in 5 !
ways to form different words.
Therefore total number of words , each of 2 vowels & 3 consonants,which can
be formed using the letters of the given word = 3 X 10 X 5! =30 X 120 = 3600

The word EQUATION has 8 letters in which there are 5 vowels (ie A, E , I O ,U )
and 3 Consonants (ie Q, T& N ) & each letter appears exactly once.

If the Vowels & consonants occur together, consider


the group of 5 vowels as 1 single letter
& the group of 3 consonants as another single letter.

Also 5 Vowels can be arranged among


themselves in 5 P 5 = 5 != 120 ways.
Also, 3 consonants can be arranged among themselves in
3
P 3 = 3 != 6 ways.
Furthur, the group of vowels and group of
consonants can be arranged = 2 != 2 ways.
[Link] 31/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

Since the
Let the number of girls selected be n ,
hence , the number of boys selected = 7 -- n

Number of ways of selecting n girls out of 4 girls = 4


Cn
Number of ways of selecting m boys out of 9 Boys = 9 C m

Number of ways of selecting n girls & m boys out of 4 girls

& 9 Boys = 4
C nX 9C m

no of girls no of Boys No of ways of selection


selected (n) selected (m = 7-n) 4 C X 9 C
n m

[Link] 32/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

This can be possible in any one of the following ways :-

no of girls no of Boys No of ways of selection


selected (n) selected (m = 7-n) 4 9
C nX C m

Total no of ways = 504 + 84 = 588

This can be possible in any one of the following 4 ways :-

no of girls no of Boys No of ways of selection


selected (n) selected (m = 7-n)
4
C nX 9C m

[Link] 33/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

4C2 X 9 C 5 = 6 X 126 = 756

C1 X 9 C 6 = 4 X 84 = 336
4

4
C0 X 9
C 7 = 1 X 36 = 36

Total number of ways = 504 + 756 +336 +36 = 1632

The word EXAMINATION has 11 letters in which letters A , I & N


each appear two times and remaining letters appear exactly once.

Since Alphabet A is the only alphabet which appears before alphabet E ,Hence
if all the different permutations of the given word are arranged as in a dictionary, then no
of words which appear in the list before the first word starting with E appears
= Total no of permutations of the given word which Start with A = 10 !
2 ! X 2 !

( Since If The permutation starts with Letter A ,


we have remaining 10 letters which can be arranged among
themselves where I & N each appear two times )
= 10 X 9 X 8 ! / 4 = 90 X 40320 / 4 =907200

[Link] 34/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

Therefore total number of words ,


which appear in the alphabetically sorted list before
the first word starting with E appears = 907200

Number of digits available (ie 0 ,1, 3, 5 7 , 9 ) = 6


No of digits required to form a 6 digit number = 6
Since a 6 digit number which is divisible by 10 can have 0 at the units place ,
therefore the number of ways of filling the
units digit (ie only 0 )= 1
Since Repetition of the digits is not allowed, the remaining 5 places can be filled &
arranged using remaining 5 digits in 5 P5 ways
Total number of 6 digit numbers divisible by 10 which can be formed using the

given 6 digits = 1 X 5 P5 = 1 X 5 ! = 120

No of ways of selecting 2 Vowels out of 5 Vowels = 5 C 2= 10


No of ways of selecting 2 Consonants out of 21 Consonants = 21 C2= 210

= 21 X 20 / 2 = 210
Furthur, the total 4 letters( 2 Consonants & 2 Vowels) can be arranged in 4 ! ways
to form different words.
Therefore total number of words , each of 2 different vowels & 2 different
consonants,which can be formed using the letters of the given word

= 10 X 210 X 4! = 2100 X 24 = 50400

Let the number of Questions attempted from Part I be n &


Let the number of Questions attempted from Part II be m .
Since total number of Questions to be attempted in total = 8

[Link] 35/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

∴ m + n = 8 ie m = 8 -- n

Number of ways of selecting n Questions from Part I with 5 Questions = 5


Cn
Number of ways of selecting m Questions from Part II with 7 Questions = 7C m

Hence if a student wants to attempt 8 questions in all , Number of ways of selection


Number of Questions attempted Number of Questions attempted
from selecting
part I with 5atQuestions from part,
( n ) each
least 3 from part II with 7 Questions

( m = 8 - ways
then it can be done in the following n ) :--
5 C n X 7C m

3 8 -3 = 5
5
C 3 X 7C 5 = 10 X 21=210

4 C 4 X 7C 4 = 5 X 35 =175
5
4

5 3 5
C 5 X 7C 3= 1 X 35 = 35

Total number of ways = 210 + 175 + 35 = 4 2 0

similar to Q no -6 of Ex- 7.4

7 Page

[Link] 36/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

[Link] 37/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

In a deck of 52 cards these are 4 kings and 48 non kingcards.


No of ways of selecting one king out of 4 kings = 4C1 = 4.
No of ways of selecting 4 Non king Cards out of 48 Non
kingcards = 48 C 4 = .

778320

W W W W
If 5 Men & 4 women are to be seated , then there are total 9 seats/
positions . Out of these 9 positions there are 4 even positions (ie
second, fourth, sixth & eight positions)
No of ways of seating the 4 women in 4 even positions = 4 ! = 24
[Link] 38/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader

After the 4 women have been seated, then we have 5 odd positions
left(ie First, Third,fifth, seventh & ninth Positions) in which the five
men can be seated in 5 ! ie 120 ways
Hence total number of arrangements possible such that women
occupy even places
= 24 X 120 = 2 8 8 0

number of students available = 25


number of students to be selected = 1 0 .
Since three students decide that either all of them will join
OR none of them will join
Hence Excursion party can be chosen in the following two ways :--

Case Number of ways of selection

Three particular students join the


party ie7students will be selected
from remaining 22 students
3
C3 X 22
C 7= 1 X 22
C7

Three particular
students do not join the party ie 3 C0 X 22 C 10= 1 X 22 C 10
all 10students will be selected
from remaining 22 students

Total number of ways = 22 C 7 + 22


C 10

The word ASSASSINATION has 13 letters in which letter


S appear 4 times
[Link] 39/40
9/13/25, 8:12 PM Smart Notebook Viewer and Reader
each , letter A appears thrice & I & N appear two times , T & O
appear exactly once .

Since If all Four S are together,consider the group of Four S as 1 single


letter .
Furthur, the total 10 letters( 1 letter of 4 S & 9 other letters)
arranged in 10 ! / 3! X 2 ! X 2 !ways to form different words
(including the 1 letter of 4 S )
since letter A appears thrice & I & N appear two times
Total number of words which can be formed using all letters
exactly once and all 4 S s are together
= 1 0 ! / ( 3! X 2 ! X 2 ! )
= 90 X 40320 / 24
= 3628800 / 24
= 151200

8 Page

[Link] 40/40

You might also like