Questions

Solve the Following Question.(4 Marks)

Take a timed test

15 questions · self-marked practice — reveal the answer and mark yourself.

Question 14 Marks
There are 12 distinct points A, B, C, …, L, in order, on a circle. Lines are drawn passing through each pair of points.
(i)How many lines are there in total?
(ii)How many lines pass through D?
(iii)How many triangles are determined by lines?
(iv)How many triangles have on vertex C?
Answer
1. We need two points to draw a line.$\therefore$ Total number of lines $={ }^{12} C_2=66$2. Lines are drawn passing through each pair of points. ∴ Lines from point D will pass through all the remaining 11 points. ∴ 11 lines pass through D.
3. We need three points to draw a triangle.$\therefore$ Number of triangles $={ }^{12} C_3=220$
4. To get the triangles with one vertex as C, we need two vertices from the remaining 11 vertices.$\therefore$ Number of triangles with vertex at $C={ }^{11} C_2$
$=\frac{11 \times 10}{2}$
$=55$
View full question & answer
Question 24 Marks
A group consists of 9 men and 6 women. A team of 6 is to be selected. How many of possible selections will have at least 3 women?
View full question & answer
Question 34 Marks
Find the number of diagonals of an n-sided polygon. In particular, find the number of diagonals when
1. $n = 10$
2. $n = 15$
3. $n = 12$
4. $n = 8$
Answer
1.In n-sided polygon, there are ‘n’ points and ‘n’ sides.$\therefore$ Through ' $n$ ' points we can draw ${ }^n C_2$ lines including sides.
$\therefore$ Number of diagonals in $n$ sided polygon $={ }^n C _2- n$ ( $n =$ number of sides)
$ n =10,$
${ }^{ n } C _2- n ={ }^{10} C _2-10$
$=\frac{10 \times 9}{1 \times 2}-10$
$=45-10$
$=35$
2.$n =15,{ }^{ n } C _2- n ={ }^{15} C _2-15$
$ =\frac{15 \times 14}{1 \times 2}-15$
$ =105-15$
$ =90$
3.$ n =12,{ }^{ n } C _2- n ={ }^{12} C _2-12$
$ =\frac{12 \times 11}{1 \times 2}-12$
$ =66-12$
$ =54$
4.$ n =8,{ }^{ n } C _2- n ={ }^8 C _2-8$
$ =\frac{8 \times 7}{1 \times 2}-8$
$ =28-8$
$ =20$
View full question & answer
Question 64 Marks
Five men, two women, and a child sit around a table. Find the number of arrangements where the child is seated (a) between the two women.(B)between two men.
Answer
5 men, 2 women, and a child sit around a table.

(a) When the child is seated between two women.

5 men, 2 women, and a child are to be seated around a round table such that the child is seated between two women.

∴ the two women can be seated on either side of the child in 2! ways.

Let us consider these 3 (two women and a child) as one unit.

Now, this one unit is to be arranged with the remaining 5 men, i.e., a total of 6 units are to be arranged around a round table, which can be done in (6 – 1)! = 5! ways.

∴ Required number of arrangements = 5! × 2! = 120 × 2 = 240

B. Two men can be selected from 5 men in

${ }^5 C_2=\frac{5 !}{2 !(5-2) !}=\frac{5 \times 4 \times 3 !}{2 \times 3 !}=10$ ways.

Also, these two men can sit on either side of the child in 2! ways.

Let us take two men and a child as one unit.

Now, this one unit is to be arranged with the remaining 3 men and 2 women,

i.e., a total of 6 units (3 + 2 + 1) are to be arranged around a round table, which can be done in (6 – 1)! = 5! ways.

∴ Required number of arrangements = 10 × 2! × 5! = 10 × 2 × 120 = 2400

View full question & answer
Question 74 Marks
Delegates from 24 countries participate in a round table discussion. Find the number of seating arrangements where two specified delegates are (a) always together .
Answer
A. Delegates of 24 countries are to participate in a round table discussion such that two specified delegates are always together.Let us consider these 2 delegates as one unit. They can be arranged among themselves in 2! ways.
Also, these two delegates are to be seated with 22 other delegates (i.e. total of 23) which can be done in (23 – 1)! = 22! ways.
∴ Required number of arrangements = 2! × 22!
B. When 2 specified delegates are never together then, other 22 delegates can be participate in a round table discussion in (22 – 1)! = 21! ways. ∴ There are 22 places of which any 2 places can be filled by those 2 delegates so that they are never together.$\therefore$ Two specified delegates can be arranged in ${ }^{22} P _2$ ways.
$\therefore$ Required number of arrangements $={ }^{22} P _2 \times 21$ !
$=\frac{22 !}{(22-2) !} \times 21 !$
$=\frac{22 !}{20 !} \times 21 !$
$=22 \times 21 \times 21 !$
$=21 \times 22 \times 21 !$
$=21 \times 22 !$
View full question & answer
Question 84 Marks
Find the number of different ways of arranging letters in the word PLATOON if (a) the two O’s are never together. (b) consonants and vowels occupy alternate positions.
Answer
There are 7 letters in the words PLATOON in which ‘O’ repeat 2 times. (a) When the two O’s are never together. Let us arrange the other 5 letters first, which can be done in 5! = 120 ways. The letters P, L, A, T, N create 6 gaps, in which O’s are arranged.Two O's can take their places in ${ }^6 P _2$ waysBut ‘O’ repeats 2 times.
$\therefore$ Two O's can be arranged in $\frac{{ }^6 P _2}{2 !}$
$=\frac{\frac{6 !}{(6-2) !}}{2 !}$
$=\frac{6 \times 5 \times 4 !}{4 ! \times 2 \times 1}$
$=3 \times 5$
= 15 ways ∴ Required number of arrangements = 120 × 15 = 1800
When consonants and vowels occupy alternate positions. There are 4 consonants and 3 vowels in the word PLATOON. ∴ At odd places, consonants occur and at even places, vowels occur. 4 consonants can be arranged among themselves in 4! ways. 3 vowels in which O occurs twice and A occurs once.
$\therefore$ They can be arranged in $\frac{3 !}{2 !}$ ways.
Now, vowels and consonants should occupy alternate positions.
$\therefore$ Required number of arrangements $=4 ! \times \frac{3 !}{2 !}$
$=4 \times 3 \times 2 \times \frac{3 \times 2 !}{2 !}$
$=72$
View full question & answer
Question 94 Marks
Find the number of different arrangements of letters in the word MAHARASHTRA. How many of these arrangements have (a) letters R and H never together? (b) all vowels together?
Answer
There are 11 letters in the word MAHARASHTRA in which ‘A’ is repeated 4 times, ‘H’ repeated 2 times, and ‘R’ repeated 2 times.

$\therefore$ Total number of words can be formed $=\frac{11 !}{4 ! 2 ! 2 !}$

When letters R and H are never together. Other than 2R, 2H there are 4A, 1S, 1T, 1M.

These letters can be arranged in $\frac{7 !}{4 !}$ ways $=210$.

These seven letters create 8 gaps in which 2R, 2H are to be arranged.

Number of ways to do $=\frac{{ }^8 P _4}{2 ! 2 !}=420$

Required number of arrangements = 210 × 420 = 88200.

When all vowels are together. There are 4 vowels in the word MAHARASHTRA, i.e., A, A, A, A.

Let us consider these 4 vowels as one unit, which can be arranged among themselves in $\frac{4 !}{4 !}$

= 1 way. This unit is to be arranged with 7 other letters in which ‘H’ is repeated 2 times, ‘R’ is repeated 2 times.

$\therefore$ Total number of arrangements $=\frac{8 !}{2 ! 2 !}$

View full question & answer
Question 104 Marks
3 boys and 3 girls are to sit in a row. How many ways can this be done if

(A)there are no restrictions.

(B)there is a girl at each end.

(C)boys and girls are at alternate places.

(D)all-boys sit together.

Answer
A. 3 boys and 3 girls are to be arranged in a row. (i) When there are no restrictions. ∴ Required number of arrangements = 6! = 720

B. When there is a girl at each end. 3 girls can be arranged at two ends in

${ }^3 P_2=\frac{3 !}{1 !}=3 \times 2=6$ ways.

And remaining 1 girl and 3 boys can be arranged between the two girls in ${ }^4 P _4=4 !=24$

ways. ∴ Required number of arrangements = 6 × 24 = 144

C. Boys and girls are at alternate places.

We can first arrange 3 girls among themselves in ${ }^3 P_3=3 !=6$ ways.

Let girls be denoted by G. G – G – G – There are 3 places marked by ‘-’ where 3 boys can be arranged in 3! = 6 ways. ∴ Total number of such arrangements = 6 × 6 = 36 OR Similarly, we can first arrange 3 boys in 3! = 6 ways and then arrange 3 girls alternately in 3! = 6 ways. ∴ Total number of such arrangements = 6 × 6 = 36 ∴ Required number of arrangements = 36 + 36 = 72

D. All boys sit together. Let us consider all boys as one group.

This one qroup with the other 3 girls can be arranged ${ }^4 P_4=4 !=24$ ways.

Also, 3 boys can be arranged among themselves in ${ }^3 P _3=3 !=6$ ways.

∴ Required number of arrangements = 24 × 6 = 144

View full question & answer
Question 114 Marks
Determine the number of arrangements of letters of the word ALGORITHM if .

(a) vowels are always together.

(B)no two vowels are together.

(C)consonants are at even positions.

(D)O is the first and T is the last letter.

Answer
(A)There are 9 letters in the word ALGORITHM. (a) When vowels are always together. There are 3 vowels in the word ALGORITHM (i.e., A, I, O). Let us consider these 3 vowels as one unit. This unit with 6 other letters is to be arranged. ∴ The number of arrangement = 7P7 = 7! = 5040 3 vowels can be arranged among themselves in 3P3 = 3! = 6 ways. ∴ Required number of arrangements = 7! × 3! = 5040 × 6 = 30240

(B)When no two vowels are together. There are 6 consonants in the word ALGORITHM

they can be arranged among themselves in ${ }^6 P _6=6 !=720$ ways.

Let consonants be denoted by C. _C _C_ C _C_C_C There are 7 places marked by ‘_’ in which 3 vowels can be arranged.

$\therefore$ Vowels can be arranged in ${ }^7 P_3=\frac{7 !}{(7-3) !}=\frac{7 \times 6 \times 5 \times 4 !}{4 !}=210$ ways.

∴ Required number of arrangements = 720 × 210 = 151200

(C)"When consonants are at even positions.

There are 4 even places and 6 consonants in the word ALGORITHM.

$\therefore 6$ consonants can be arranged at 4 even positions in $6 P 4=\frac{6 !}{(6-4) !}=\frac{6 \times 5 \times 4 \times 3 \times 2 !}{2 !}=360$

ways.

Remaining 5 letters ( 3 vowels and 2 consonants) can be arranged in odd position in ${ }^5 P_5=$

5! = 120 ways. ∴ Required number of arrangements = 360 × 120 = 43200"

(D)When O is the first and T is the last letter. All the letters of the word ALGORITHM are to be arranged among themselves such that arrangement begins with O and ends with T. ∴ Position of O and T are fixed.

$\therefore$ Other 7 letters can be arranged between $O$ and $T$ among themselves in ${ }^7 P_7=7 !=5040$

ways. ∴ Required number of arrangements = 5040

View full question & answer
Question 134 Marks
How many five-digit numbers formed using the digit 0, 1, 2, 3, 4, 5 are divisible by 5 if digits are not repeated?
Answer
Here, repetition of digits is not allowed. For a number to be divisible by 5, unit’s place digit should be 0 or 5. Case I: when unit’s place is 0 Unit’s place digit can be selected in 1 way. 10’s place digit can be selected in 5 ways. 100’s place digit can be selected in 4 ways. 1000’s place digit can be selected in 3 ways. 10000’s place digit can be selected in 2 ways. ∴ Total number of numbers = 1 × 5 × 4 × 3 × 2 = 120. Case II: when the unit’s place is 5 Unit’s place digit can be selected in 1 way. 10000’s place should be a non-zero number. ∴ It can be selected in 4 ways. 1000’s place digit can be selected in 4 ways. 100’s place digit can be selected in 3 ways. 10’s place digit can be selected in 2 ways. ∴ Total number of numbers = 1 × 4 × 4 × 3 × 2 = 96 ∴ Total number of required numbers = 120 + 96 = 216
View full question & answer
Question 144 Marks
How many numbers between 100 and 1000 have the digit 7 exactly once?
Answer
Numbers between 100 and 1000 are 3-digit numbers. A 3-digit number is to be formed from the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, where exactly one of the digits is 7. When 7 is in unit’s place: Unit’s place digit is 7. ∴ it can be selected in 1 way only. 10’s place digit can be selected in 9 ways. 100’s place digit can be selected in 8 ways. Total numbers which have 7 in unit’s place = 1 × 9 × 8 = 72. When 7 is in 10’s place: Unit’s place digit can be selected in 9 ways. 10’s place digit is 7. ∴ it can be selected in 1 way only. 100’s place digit can be selected in 8 ways. ∴ A total number of numbers which have 7 in 10’s place = 9 × 1 × 8 = 72. When 7 is in 100’s place: Unit’s place digit can be selected in 9 ways. 10’s place digit can be selected in 9 ways. 100’s place digit is 7. ∴ it can be selected in 1 way only. ∴ Total numbers which have 7 in 100’s place = 9 × 9 × 1 = 81. ∴ Total numbers between 100 and 1000 having digit 7 exactly once = 72 + 72 + 81 = 225
View full question & answer
Question 154 Marks
How many three-digit numbers can be formed from the digits 0, 1, 3, 5, 6 if repetitions of digits (i) are allowed (ii) are not allowed?
Answer
A three-digit number is to be formed from the digits 0, 1, 3, 5, 6. (i) When repetition of digits is allowed, 100’s place digit should be a non-zero number. Hence, it can be anyone from digits 1, 3, 5,6. ∴ 100’s place digit can be selected in 4 ways. 10’s and unit’s place digit can be zero and digits can be repeated. ∴ 10’s place digit can be selected in 5 ways and the unit’s place digit can be selected in 5 ways. ∴ By using the fundamental principle of multiplication, the total number of three-digit numbers = 4 × 5 × 5 = 100 (ii) When repetition of digits is not allowed, 100’s place digit should be a non-zero number. Hence, it can be anyone from digits 1, 3, 5, 6. ∴ 100’s place digit can be selected in 4 ways. 10’s and unit’s place digit can be zero and digits can’t be repeated. ∴ 10’s place digit can be selected in 4 ways and the unit’s place digit can be selected in 3 ways. ∴ By using the fundamental principle of multiplication, the total number of two-digit

numbers = 4 × 4 × 3 = 48

View full question & answer