If\[{\rm{\;}}{{\rm{P}}_{\rm{n}}}\]denotes the number of n-letter words which can be formed using all letters of the word “GOOGLE” under the condition that no two consecutive letters are identical. Then the value of \[\dfrac{{{{\rm{P}}_{\rm{n}}}}}{{{{\rm{P}}_{{\rm{n - 1}}}}}}\]is (where unlimited supply of each letter of the above word is given)-
A.4
B.5
C.3
D.A number greater than 25
Answer
661.8k+ views
Hint: Here we have to use the concept of the permutation to form an n letter word with five letters in the word “GOOGLE”. So here firstly we have to see how many distinct letters are there to make a word as no two consecutive letters are identical. Then we have to apply the formula of permutation to find out the number of n letter words that can be formed. Then similarly finding the number of \[{\rm{n - 1}}\] letter words that can be formed. Then by dividing them, we will get the required ratio.
Formula used:
Number of permutations of n things, taken r at a time, denoted by \[{}^{\rm{n}}{{\rm{P}}_{\rm{r}}} = \dfrac{{{\rm{n}}!}}{{{\rm{(n - r)}}!}}\]
Complete step-by-step answer:
The given word is “GOOGLE” whole letters are used to form words. So, there are only 4 distinct letters available for the formation of the words i.e. G, O, L, E.
The words that are formed is subjected to a condition of no two consecutive letters are identical. So, for the first letter of the word we have a choice of 4 letters but for all the remaining letters of the word we will have a choice of 3 letters.
So number of ways in which first letter of the word is selected\[{\rm{ = }}{}^4{{\rm{P}}_1} = \dfrac{{4!}}{{{\rm{(4}} - {\rm{1)}}!}} = \dfrac{{4!}}{{{\rm{(}}3{\rm{)}}!}} = 4\]
Now number of ways in which all the remaining letters of the word is selected \[{\rm{ = }}{}^3{{\rm{P}}_1} = \dfrac{{3!}}{{{\rm{(3}} - {\rm{1)}}!}} = \dfrac{{3!}}{{{\rm{(2)}}!}} = 3\]
Here 3 is multiplied \[{\rm{n - 1}}\] times as for the first letter is selected in 4 ways and then all the remaining \[{\rm{n - 1}}\] letters is selected in 3 ways. Therefore, we get
Therefore, number of ways n letter words that can be formed \[ = 4 \times 3 \times 3 \times ....\]
We can write number of ways n letter words that can be formed as \[ = 4 \times {3^{({\rm{n}} - 1)}}\]
\[ \Rightarrow {{\rm{P}}_{\rm{n}}} = 4 \times {3^{({\rm{n}} - 1)}}\]
Similarly, number of ways \[{\rm{n - 1}}\] letter words that can be formed\[ = 4 \times {3^{({\rm{n}} - 2)}}\]
\[ \Rightarrow {{\rm{P}}_{{\rm{n - 1}}}} = 4 \times {3^{({\rm{n}} - 2)}}\]
Now we have to find their ration, we get
\[ \Rightarrow \dfrac{{{{\rm{P}}_{\rm{n}}}}}{{{{\rm{P}}_{{\rm{n - 1}}}}}}{\rm{ = }}\dfrac{{4 \times {3^{({\rm{n}} - 1)}}}}{{4 \times {3^{({\rm{n}} - 2)}}}}{\rm{ = }}\dfrac{{4 \times {3^{({\rm{n}} - 2)}} \times 3}}{{4 \times {3^{({\rm{n}} - 2)}}}}{\rm{ = 3}}\]
\[ \Rightarrow \dfrac{{{{\rm{P}}_{\rm{n}}}}}{{{{\rm{P}}_{{\rm{n - 1}}}}}}{\rm{ = 3}}\]
Hence, option C is the correct option.
Note: Here we have to keep in mind to use the concept of permutation rather than combination. As permutations may be defined as the different ways in which a collection of items can be arranged. For example: The different ways in which the numbers 1, 2 and 3 can be grouped together, taken all at a time, are\[123,{\rm{ }}132,{\rm{ }}213{\rm{ }}231,{\rm{ }}312,{\rm{ }}321\].
Combinations may be defined as the various ways in which objects from a set may be selected. For example: The different selections possible from the numbers 1, 2, 3 taking 2 at a time, are \[{\rm{12, 23\, and\, 31}}\]
Formula used:
Number of permutations of n things, taken r at a time, denoted by \[{}^{\rm{n}}{{\rm{P}}_{\rm{r}}} = \dfrac{{{\rm{n}}!}}{{{\rm{(n - r)}}!}}\]
Complete step-by-step answer:
The given word is “GOOGLE” whole letters are used to form words. So, there are only 4 distinct letters available for the formation of the words i.e. G, O, L, E.
The words that are formed is subjected to a condition of no two consecutive letters are identical. So, for the first letter of the word we have a choice of 4 letters but for all the remaining letters of the word we will have a choice of 3 letters.
So number of ways in which first letter of the word is selected\[{\rm{ = }}{}^4{{\rm{P}}_1} = \dfrac{{4!}}{{{\rm{(4}} - {\rm{1)}}!}} = \dfrac{{4!}}{{{\rm{(}}3{\rm{)}}!}} = 4\]
Now number of ways in which all the remaining letters of the word is selected \[{\rm{ = }}{}^3{{\rm{P}}_1} = \dfrac{{3!}}{{{\rm{(3}} - {\rm{1)}}!}} = \dfrac{{3!}}{{{\rm{(2)}}!}} = 3\]
Here 3 is multiplied \[{\rm{n - 1}}\] times as for the first letter is selected in 4 ways and then all the remaining \[{\rm{n - 1}}\] letters is selected in 3 ways. Therefore, we get
Therefore, number of ways n letter words that can be formed \[ = 4 \times 3 \times 3 \times ....\]
We can write number of ways n letter words that can be formed as \[ = 4 \times {3^{({\rm{n}} - 1)}}\]
\[ \Rightarrow {{\rm{P}}_{\rm{n}}} = 4 \times {3^{({\rm{n}} - 1)}}\]
Similarly, number of ways \[{\rm{n - 1}}\] letter words that can be formed\[ = 4 \times {3^{({\rm{n}} - 2)}}\]
\[ \Rightarrow {{\rm{P}}_{{\rm{n - 1}}}} = 4 \times {3^{({\rm{n}} - 2)}}\]
Now we have to find their ration, we get
\[ \Rightarrow \dfrac{{{{\rm{P}}_{\rm{n}}}}}{{{{\rm{P}}_{{\rm{n - 1}}}}}}{\rm{ = }}\dfrac{{4 \times {3^{({\rm{n}} - 1)}}}}{{4 \times {3^{({\rm{n}} - 2)}}}}{\rm{ = }}\dfrac{{4 \times {3^{({\rm{n}} - 2)}} \times 3}}{{4 \times {3^{({\rm{n}} - 2)}}}}{\rm{ = 3}}\]
\[ \Rightarrow \dfrac{{{{\rm{P}}_{\rm{n}}}}}{{{{\rm{P}}_{{\rm{n - 1}}}}}}{\rm{ = 3}}\]
Hence, option C is the correct option.
Note: Here we have to keep in mind to use the concept of permutation rather than combination. As permutations may be defined as the different ways in which a collection of items can be arranged. For example: The different ways in which the numbers 1, 2 and 3 can be grouped together, taken all at a time, are\[123,{\rm{ }}132,{\rm{ }}213{\rm{ }}231,{\rm{ }}312,{\rm{ }}321\].
Combinations may be defined as the various ways in which objects from a set may be selected. For example: The different selections possible from the numbers 1, 2, 3 taking 2 at a time, are \[{\rm{12, 23\, and\, 31}}\]
Recently Updated Pages
Write the number of covalent bonds in the molecule class 11 chemistry CBSE

Master Class 11 Social Science: Engaging Questions & Answers for Success

Master Class 11 English: Engaging Questions & Answers for Success

Master Class 11 Maths: Engaging Questions & Answers for Success

Master Class 11 Chemistry: Engaging Questions & Answers for Success

Class 11 Question and Answer - Your Ultimate Solutions Guide

Trending doubts
One Metric ton is equal to kg A 10000 B 1000 C 100 class 11 physics CBSE

Find the value of the expression given below sin 30circ class 11 maths CBSE

Which of the following viruses contains both DNA and class 11 biology CBSE

10 examples of friction in our daily life

Difference between physical and chemical change class 11 chemistry CBSE

Bond order ofO2 O2+ O2 and O22 is in order A O2 langle class 11 chemistry CBSE

