All the letters of the word PUBLIC are written in all possible orders and these words are written as in a dictionary with serial numbers. Then the serial number of the word PUBLIC is [2023]
580
582
576
578
(2)
No. of words formed when word starts from B = 5!
No. of words formed when word starts from C = 5!
No. of words formed when word starts from I = 5!
No. of words formed when word starts from L = 5!
No. of words formed when word starts from PB = 4!
No. of words formed when word starts from PC = 4!
No. of words formed when word starts from PI = 4!
No. of words formed when word starts from PL = 4!
No. of words formed when word starts from PUBC = 2!
No. of words formed when word starts from PUBI = 2!
No. of words formed when word starts from PUBLC = 1
Now, the word comes is PUBLIC = 1
∴ Serial number of word PUBLIC
= 4 × 5! + 4 × 4! + 2 × 2! + 1 + 1 = 582
The number of arrangements of the letters of the word "INDEPENDENCE" in which all the vowels always occur together is
14800
16800
18000
33600
The number of ways in which 5 girls and 7 boys can be seated at a round table so that no two girls sit together, is [2023]
(2)

Number of girls = 5
Number of boys = 7
The number of ways of arranging boys around a table is (7 – 1)! = 6!
Now, there are 7 spaces in between two boys, so 5 girls arranged in 7 gaps by ways.
So, required number of ways =
If the number of words, with or without meaning. which can be made using all the letters of the word MATHEMATICS in which C and S do not come together, is (6!)k, then k is equal to [2023]
5670
945
2835
1890
(1)
In the word ''MATHEMATICS'' there are,
Total number of words formed by the letters of the word ''MATHEMATICS'' is
Number of words in which 'C' and 'S' come together is
Then, number of words in which 'C' and 'S' do not come together is
Eight persons are to be transported from city A to city B in three cars of different makes. If each car can accommodate at most three persons, then the number of ways, in which they can be transported, is [2023]
3360
1120
1680
560
(3)
8 persons can be divided into 3 groups of 3, 3, and 2 members each.
If the letters of the word MATHS are permuted and all possible words so formed are arranged as in a dictionary with serial numbers, then the serial number of the word THAMS is [2023]
103
104
101
102
(1)
Given word is MATHS.
In alphabetical order: A, H, M, S, T
Now, word starting with
A_ _ _ _ i.e., 4! ; H_ _ _ _ i.e., 4!
M_ _ _ _ i.e., 4! ; S_ _ _ _ i.e., 4!
T A_ _ _ i.e., 3! ; T H A M S i.e., 1
The number of five digit numbers, greater than 40000 and divisible by 5, which can be formed using the digits 0, 1, 3, 5, 7 and 9 without repetition, is equal to [2023]
132
120
72
96
(2)
Numbers greater than 40000 and divisible by 5 can be formed using digits 0, 1, 3, 5, 7, 9 in the following ways:
| Number of ways | |
|---|---|
| 5 _ _ _ 0 | 4 × 3 × 2 × 1 = 24 |
| 7 _ _ _ 0 | |
| 7 _ _ _ 5 | 4 × 3 × 2 × 2 = 48 |
| 9 _ _ _ 0 | |
| 9 _ _ _ 5 | 4 × 3 × 2 × 2 = 48 |
Total number of ways = 24 + 48 + 48 = 120
All words, with or without meaning, are made using all the letters of the word MONDAY. These words are written as in a dictionary with serial numbers. The serial number of the word MONDAY is [2023]
327
328
326
324
(1)
Given, A, D, M, N, O, Y
A → 5! ; D → 5! ; M A → 4! ; M N → 4!
M O A → 3! ; M O D → 3! ; M O N A → 2! ; M O N D A Y
⇒ Rank = 2(5)! + 3(4)! + 2(3)! + 2! + 1
= 240 + 72 + 12 + 2 + 1 = 327
The total number of three-digit numbers, divisible by 3, which can be formed using the digits 1, 3, 5, 8, if repetition of digits is allowed, is [2023]
18
21
22
20
(3)
Case I: All the three digits are same i.e., 111, 333, 555, 888. All the numbers are divisible by 3.
Case II: Two digits are same.
We can see that when two digits are same, then numbers having digits 5, 5, 8 or 8, 8, 5 will be divisible by 3 as their sum is divisible by 3.
Now, for each number, we have arrangements.
In this case, we have 6 numbers divisible by 3.
Case III: All digits are distinct.
i.e., (1, 3, 5), (1, 3, 8)
So, number formed = 2 × 3! = 12
Hence, total 3-digit numbers formed by digits 1, 3, 5, 8 and divisible by 3 is 4 + 6 + 12 = 22.
The number of square matrices of order 5 with entries from the set {0, 1}, such that the sum of all the elements in each row is 1 and the sum of all the elements in each column is also 1, is [2023]
225
120
125
150
(2)
In first column, 1 can be placed in any of the 5 places = 5
In second column, 1 can be placed in any of the 4 places = 4
In third column, 1 can be placed in any of the 3 places = 3
In fourth column, 1 can be placed in any of the 2 places = 2
In fifth column, 1 can be placed in any of the 1 place = 1
Required number of ways = 5 × 4 × 3 × 2 × 1 = 120