Statistics for Data Science-1

Week-5 Graded Assignment

1. Vinod has n registers and m cover papers of different colours. In how many ways can
he cover all the registers with cover papers?
Answer: m × (m − 1) × (m − 2) × ... × (m − n + 1)
Solution:
For the 1st register, he can choose any of the m covers. So, number of ways to cover
the first register with cover paper = m ways.
For the 2nd register, he can choose any of the remaining (m − 1) covers. So, number
of ways to cover the second register with cover paper = m − 1 ways.
Similarly, for nth register, he can choose any of the remaining (m − n + 1) covers. So,
number of ways to cover the second register with cover paper = m − n + 1 ways.
Hence, total number of ways in which he can cover all the registers with colour
papers=m × (m − 1) × (m − 2) × ... × (m − n + 1) ways.

For example:
Suppose, we substitute values of n and m as 6 and 10 respectively.
For the 1st register, he can choose any of the 10 covers. So, number of ways to cover
the first register with cover paper = 10 ways.
For the 2nd register, he can choose any of the remaining (10 − 1) covers. So, number
of ways to cover the second register with cover paper = 10 − 1 = 9 ways.
Similarly, for 6th register, he can choose any of the remaining (10 − 6 + 1) covers. So,
number of ways to cover the second register with cover paper = 5 ways.
Hence, total number of ways in which he can cover all the registers with cover papers
is
= 10 × 9 × 8 × 7 × 6 × 5 = 151200 ways.

2. n classmates could not agree on who would stand in the group photo along with the
teacher for the yearbook. How many possible groups can be made such that there is
at least one student with the teacher in the photo?
Answer: 2n − 1
Solution:
Either a student be in that group photo or not. So, each student has 2 possibilities.
The possibility that there may be 0 students along with the teacher in the group
photo=1, as there is only 1 possible case of not selecting any of the n students.
Hence, the total number of possible sets for a group photo where there is at least one
student with the teacher=2n − 1

1
 For example:
Suppose, we substitute values of n as 7.
Either a student be in that group photo or not. So, each student has 2 possibilities.
The possibility that there may be 0 students along with the teacher in the group
photo=1, as there is only 1 possible case of not selecting any of the 7 students.
Hence, the total number of possible sets for a group photo along with a teacher such
that there is at least one student with a teacher in the photo = 27 − 1 = 127 ways.

Jay bought a new car in New York where a license plate can be created with alphabets
A, B, C, D, E, W, X, Y, Z and numbers 0 to 9. He can either select a normal license
plate or a VIP license plate. The VIP license plate begins with m alphabets followed
by n numbers with repetition allowed. The normal license plate begins with a num-
bers followed by b alphabets without repetition. Based on this information, answer
questions (3) and (4):

3. In how many ways can he select the VIP license plate?

Answer: 9m × 10n
Solution:
Total choice of alphabets = 9 i.e. A,B,C,D,E,W,X,Y and Z
Number of ways to select m alphabets with repetition = 9m
Number of ways to select n numbers with repetition = 10n
Hence, number of ways he can select VIP License Plate = 9m × 10n

For example:
Suppose, we substitute values of m and n as 2 and 4 respectively.
Number of ways to select 2 alphabets with repetition = 92
Number of ways to select 4 numbers with repetition = 104
Hence, number of ways he can select VIP License Plate = 92 × 104 = 81000 ways.

4. In how many ways can he select the license plate(normal or VIP)?

Answer: [9m × 10n ] + [9(9 − 1)...(9 − (b − 1)) × 10(10 − 1)...(10 − (a − 1))]
Solution:
For the normal license plate:
Number of ways to select b alphabets without repetition = 9×(9−1)×...×(9−(b−1))
Number of ways to select a numbers without repetition = 10×(10−1)×...×(10−(a−1))
Hence, number of ways he can select the normal license plate
=[9 × (9 − 1) × ... × (9 − (b − 1))] × [10 × (10 − 1) × ... × (10 − (a − 1))]
Therefore, total number of ways he can select the license plate = Number of ways he
can select VIP License Plate + Number of ways he can select the normal license plate
=[9m × 10n ] + [9(9 − 1)...(9 − (b − 1)) × 10(10 − 1)...(10 − (a − 1))]

2
 For example:
Suppose, we substitute values of m, n, a and b as 2, 4, 2 and 3 respectively.
For the normal license plate
Number of ways to select 3 alphabets without repetition = 9 × (9 − 1) × (9 − 2)
Number of ways to select 2 numbers without repetition = 10 × (10 − 1)
Hence, number of ways he can select the normal license plate is
=[9 × 8 × 7] × [10 × 9] = 45360 ways.
Therefore, total number of ways he can select the license plate = Number of ways he
can select VIP License Plate + Number of ways he can select the normal license plate
=[92 × 104 ] + [9 × 8 × 7 × 10 × 9] = 810000 + 45360 = 855360 ways.

5. Ram has n trophies that he wishes to place in his main cabinet, which has space only
for two trophies. If the number of trophies is increased by 3, then the number of pos-
sible ways to arrange the trophies in the main cabinet becomes 5 times the number of
ways to arrange n trophies. How many trophies does Ram have?
Answer: 3
Solution:
Number of ways Ram can place his n trophies in the main cabinet = n(n − 1)
Number of ways Ram can place his (n+3) trophies in the main cabinet = (n+3)(n+2)
It is given that:

5n(n − 1) = (n + 3)(n + 2)
5n2 − 5n = n2 + 6n − n + 6
4n2 − 10n − 6 = 0
(4n + 2)(n − 3) = 0
1
Therefore, n = 3, −
2
Since, n can not be negative.
Hence, n = 3

6. There are N students in a class. The class teacher announced that the first n students
who completes a given project within two days will be awarded. What are the possible
number of ways the students will be awarded?
N!
(a).
(N − n)!
N!
(b).
(N − n)!n!
(c). N !
(d). (N − n)!

3
 Answer: b
Solution:
Since first n students are to be awarded, i.e., there are n awards which are to be dis-
tributed among the N students in class. Therefore, for the distribution of the first
award there are N ways and, for the second award, there are (N − 1) ways because one
award is already distributed. Similarly, 3rd , 4th , . . . , nth awards can be distributed
in (N − 2), (N − 3), ... (N − (n − 1)) ways.
Since here, events are occurring simultaneously and order doesn’t matter (because, we
are awarding the first n students and there will be no difference in awarding 3rd student
as first and then 5th student as second or 5th student as first and then 3rd student as
second etc.)

Thus, the total number of possible ways the student will be awarded,

N × (N − 1) × (N − 2)... × (N − (n − 1)) N!
= =
n! (N − n)! × n!

For example;
Suppose, we substitute values of N and n as 40 and 5 respectively.
Since first 5 students are to be awarded, i.e., there are 5 awards which are to be dis-
tributed among the 40 students in class. Therefore, for the distribution of the first
award there are 40 ways and, for the second award, there are 39 ways because one
award is already distributed. Similarly, 3rd , 4th and 5th awards can be distributed in
38, 37 and 36 ways.
Since here, events are occurring simultaneously and order doesn’t matter (because, we
are awarding the first 5 students and there will be no difference in awarding 3rd student
as first and then 5th student as second or 5th student as first and then 3rd student as
second etc.)

Thus, the total number of possible ways the student will be awarded,
40 × 39 × 38 × 37 × 36 40!
= =
5! 35! × 5!

7. N students watched a patriotic movie. An analyst wishes to ask each student whether
they liked the movie or not. Each student can either answer the question or refuse to
respond. In how many ways, can the analyst get responses from the students?
Answer: 3N
Solution:
Since each student can choose to answer like or dislike or prefer not to answer. If he
gives response then he has two options like or dislike the movie and another option is,
he does not give any response. Thus, analyst can get feedback from each student in 3
ways.

4
 From N students, analyst can get feedback in 3N ways.

For example
Suppose, we substitute value of N as 6.
Analyst can get feedback from each student in 3 ways.
From 6 students, analyst can get feedback in 36 = 729 ways.

x(n + 1)!
8. If the value of sum of first n non-zero natural numbers is equal to , then find
2z
1
the value of ?.
x
(n − 1)!
Answer:
z
Solution:
n(n + 1)
As we know, the sum of first n non-zero natural numbers is = .
2
n(n + 1) x(n + 1)!
Given, =
2 2z
x(n + 1)n(n − 1)!
n(n + 1) =
z
x(n − 1)!
1=
z
1 (n − 1)!
=
x z

For example:
Suppose, we substitute values of n and z as 7 and 3 respectively.

7(7 + 1)
The sum of the first 7 non-zero natural numbers is = .
2
7(7 + 1) x(7 + 1)!
Given, =
2 2×3
x(7 + 1)7(7 − 1)!
7(7 + 1) =
3
x(7 − 1)!
1=
3
1 (7 − 1)! 6! 720
= = = = 240
x 3 3 3

9. Adam wrote down a n-digit university roll number on a piece of paper. On his way
home from office, it rained heavily and the paper got wet. Later, he saw that the first
m digits of the roll number had disappeared. In how many ways can Adam complete
this university roll number if repetition of digits is allowed?

5
 a. m!
b. 10m
c. 10m−1 × 9
d. 9m

Answer: b
Solution:
Adam has to complete the first m digits of a n-digit university roll number with repe-
tition of digits allowed.
Now, the first digit can be filled with any number as it is a categorical variable and
does not have any numeric meaning. For example: Roll number ’000257’ is also a
5-digit roll number.
Hence, number of ways to fill first digit =10 ways.
For the second digit, he can fill it with any number 0-9. Hence, number of ways to fill
second digit = 10 ways.
Similarly, for the 3rd , 4th , ..., nth digit also, he can fill it with any number 0-9.
Hence, the number of ways to fill any of these digits = 10
Therefore, the number of ways Adam can complete the n-digit university roll number
= 10m .
Hence, option (b) is correct.
For example:
Suppose, we substitute values of n and m as 10 and 3 respectively.
Adam has to complete the first three digits of a 10-digit university roll number with
repetition of digits allowed.
Now, the first digit can be filled with any number as it is a categorical variable and
does not have any numeric meaning. For example: Roll number ’000257’ is also a
5-digit roll number.
Hence, number of ways to fill first digit =10 ways.
For the second digit, he can fill it with any number from 0-9. Hence, number of ways
to fill second digit = 10 ways.
Similarly, for the digit also, he can fill it with any digit 0-9. Hence, number of ways to
fill third digit = 10 ways.
Therefore, the number of ways Adam can complete the 10-digit university number =
10 × 10 × 10 = 103 .
Hence, option (b) is correct.

5!
10. Let x = . Which of the following expressions is/are equal to x?
4 × 3!
a. 5 × 0!
1
b. 5 ×
0!

6
 1
c. 5 ×
0
6
d. 5 ×
3! + (3 × 2) + (3 × 2 × 1)
18
e. 5 ×
3! + (3 × 2) + (3 × 2 × 1)
Answer: a, b, e
Solution:
Let us first solve for x:
5! 5 × 4 × 3!
x= = =5
4 × 3! 4 × 3!
Now,

a. 5 × 0! = 5 × 1 = 5 = x
Hence, option a is correct.
1 1
b. 5 × = 5 × = 5 = x
0! 1
Hence, option b is correct.
1
c. 5 × ̸= x
0
1
is not defined.
0
Hence, option c is incorrect.
6 6 1
d. 5 × =5× = 5 × ̸= 5 ̸= x
3! + (3 × 2) + (3 × 2 × 1) 6+6+6 3
Hence, option d is incorrect.
18 18
e. 5 × =5× =5=x
3! + (3 × 2) + (3 × 2 × 1) 6+6+6
Hence, option e is correct.