Let S be the set of all the words that can be formed by arranging all the letters of the word GARDEN. From the set S, one word is selected at random. The probability that the selected word will NOT have vowels in alphabetical order is : [2025]
(4)
We have, A E G R D N
Total = 6!
Number of cases when A and E are in order =
Probability, when A and E are in order =
Probability when A and E are in order =
For , let denote the set of all subsets of {1 2, ..., n} with no two consecutive numbers. For example but . Then is equal to __________. [2025]
13
Let A = {1, 2, 3, 4, 5, ..., n}
Number of subsets having r elements such that no two are consecutive =
For n = 5, number of ways =
Subsets having no elements = 1 i.e.,
Subsets having exactly 1 element = = 5 i.e., {1}, {2}, {3}, {4}, {5}
Subsets having exactly 2 element = = 6 i.e., {1, 3}, {1, 4}, {1, 5}, {2, 4}, {2, 5}, {3, 5}
Subsets having exactly 3 element = = 1 i.e., {1, 3, 5}
= 1 + 5 + 6 + 1 = 13
The number of singular matrices of order 2, whose elements are from the set {2, 3, 6, 9}, is __________. [2025]
36
For any singular matrix ; we ave
Case I : Exactly one number is used
All like, then required number = = 4
Case II : Exactly two number i.e., (a, a, a, b or a, a, b, b) are used, then rrequired number
Case III : Exactly three numbers i.e., (a, a, b, c) are used, then none will be singular.
Case IV : Exatly four number i.e., (a, b, c, d) are used, then ad = bc i.e.,
Total number of matrices = 36.
If , gcd (m, n) = 1, then m – n is equal to __________. [2025]
2035
We know that,
... (i)
... (ii)
Subtracting (ii) from (i), we get
Put n = 11, we get
... (iii)
Now,
[From (iii)]
m – n = 2047 – 12 = 2035.
If , then is equal to __________. [2025]
465
.
Let be the set of first ten prime numbers, Let , where P is the set of all possible products of distinct elements of S. Then the number of all ordered pairs , such that x divides y, is __________. [2025]
5120
S = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29}
For x = 2, the value of y can be
Similarly, for x = 3, 5, 7, 11, ...; y can be
Required number of ordered pair =
=
The number of 6-letter words, with or without meaning, that can be formed using the letters of the word MATHS such that any letter that appears in the word must appear at least twice, is __________. [2025]
1405
(i) Single letter is used, then number of words = 5
(ii) Two distinct letters are used, then number of words
(iii) Three distinct letters are used, then number of words
Total number of words = 1405.