In the word DAUGHTER, there are 3 vowels namely, A, U, and E, and 5 consonants namely, D, G, H, T, and R.
Number of ways of selecting 2 vowels out of 3 vowels = \(^3C_2\)=10
Number of ways of selecting 3 consonants out of 5 consonants = \(^5C_3\)=10
Therefore, number of combinations of 2 vowels and 3 consonants = 3 × 10 = 30
Each of these 30 combinations of 2 vowels and 3 consonants can be arranged among themselves in 5! ways.
Hence, required number of different words = \(30 \times 5!\) = 3600
\(f(x) = \begin{cases} x^2, & \quad 0≤x≤3\\ 3x, & \quad 3≤x≤10 \end{cases}\)
The relation g is defined by
\(g(x) = \begin{cases} x^2, & \quad 0≤x≤2\\ 3x, & \quad 2≤x≤10 \end{cases}\)
Show that f is a function and g is not a function.
Permutation is the method or the act of arranging members of a set into an order or a sequence.
Combination is the method of forming subsets by selecting data from a larger set in a way that the selection order does not matter.