How many words, with or without meaning can be made from the letters of the word \(MONDAY,\) assuming that no letter is repeated, if. \(4\) letters are used at a time,
CBSE Class 11 Maths · Permutations and Combinations
CBSE Class 11 Maths · Permutations and Combinations
Imagine you have 6 different coloured tiles, each with a letter from the word MONDAY. You want to pick any 4 of them and line them up in a row. The order matters — moving tiles around makes a completely different word. So swapping two tiles gives a brand new arrangement. Counting all the different rows you can make is exactly what this problem asks. The answer turns out to be 360 different 4-letter arrangements.
Answer: The number of 4-letter words that can be formed is \( {}^{6}P_{4} = 360 \).
The word MONDAY has 6 distinct letters: M, O, N, D, A, Y. Since no letter is repeated, forming a 4-letter word means we must choose 4 letters out of these 6 and then arrange them in a specific order. Because order matters (a word like MOND is different from DONM), this is a permutation problem, not just a combination. We use the permutation formula which counts the number of ordered arrangements of \( r \) objects taken from \( n \) distinct objects.
The number of permutations of \( n \) distinct objects taken \( r \) at a time is \[ {}^{n}P_{r} = \frac{n!}{(n-r)!} \]
The number of 4-letter words that can be formed is \( {}^{6}P_{4} = 360 \).
A common mistake is to use combinations \( {}^{6}C_{4} = 15 \) instead of permutations. Combinations only count the selection of letters and ignore their order, but here different orderings give different words, so permutations must be used.
The number of 4-letter words that can be formed is \( {}^{6}P_{4} = 360 \).
One common mistake: Using the combination formula \( {}^{6}C_{4} \) instead of \( {}^{6}P_{4} \). Combinations count selections where order does not matter, but here two arrangements of the same letters (e.g. MOND vs DONM) are different words, so order must be accounted for with permutations.
Answer: The number of 4-letter words that can be formed is \( {}^{6}P_{4} = 360 \).
Question: How many words, with or without meaning, can be formed using the letters of the word GARDEN, taken 4 at a time, assuming no letter is repeated?
Solution: The word GARDEN has 6 distinct letters: G, A, R, D, E, N. We need to form 4-letter words (arrangements) using these 6 distinct letters, with no repetition. This is a permutation problem where we select 4 letters out of 6 and arrange them. The number of such arrangements is given by: \[ {}^{6}P_{4} = \frac{6!}{(6 - 4)!} \] Simplifying the factorial expression: \[ {}^{6}P_{4} = \frac{6!}{2!} \] Expanding: \[ {}^{6}P_{4} = \frac{6 \times 5 \times 4 \times 3 \times 2!}{2!} \] Cancelling \( 2! \): \[ {}^{6}P_{4} = 6 \times 5 \times 4 \times 3 = 360 \] Therefore, the total number of 4-letter words that can be formed is 360.
Answer: 360
Question: How many words, with or without meaning, can be formed from the letters of the word JOURNEY, if 5 letters are used at a time and no letter is repeated?
Solution: The word JOURNEY has 7 distinct letters: J, O, U, R, N, E, Y. We need to form 5-letter words (arrangements) using these 7 distinct letters, with no repetition. This is a permutation problem where we select 5 letters out of 7 and arrange them. The number of such arrangements is given by: \[ {}^{7}P_{5} = \frac{7!}{(7 - 5)!} \] Simplifying: \[ {}^{7}P_{5} = \frac{7!}{2!} \] Expanding the numerator: \[ {}^{7}P_{5} = \frac{7 \times 6 \times 5 \times 4 \times 3 \times 2!}{2!} \] Cancelling \( 2! \): \[ {}^{7}P_{5} = 7 \times 6 \times 5 \times 4 \times 3 \] Calculating step by step: \( 7 \times 6 = 42 \), then \( 42 \times 5 = 210 \), then \( 210 \times 4 = 840 \), then \( 840 \times 3 = 2520 \). \[ {}^{7}P_{5} = 2520 \] Therefore, the total number of 5-letter words that can be formed is 2520.
Answer: 2520
Question: How many words, with or without meaning, can be formed using the letters of the word CAPTAIN, assuming no letter is repeated, if 3 letters are used at a time? (Note: treat all letters of CAPTAIN as distinct by considering only its unique letters.)
Answer: The number of 3-letter words that can be formed is \( {}^{6}P_{3} = 120 \).