Answer
Verified
377.7k+ views
Hint: Form 8 boxes and fix the letter T in the first box. Now, fill the remaining 7 boxes with 7 letters that are remaining by using the formula that n number of different things can be arranged in $n!$ ways. Substitute n = 7 to get the answer.
Complete step by step answer:
Here we are provided with the word EQUATION and we are asked to find the number of 8 letters words that can be formed using the letters present in the word such that the first letter is always T.
Now, we can see that there are 8 different letters in the given word so let us form 8 boxes in which the letters can be filled. The first letter should be T as per the condition given in the question, so let us fill the first box with T. Therefore we have,
Now, we need to fill the remaining 7 boxes with 7 remaining letters of the word. We know that n things can be arranged in $n!$ ways if there are n positions. So we have,
$\Rightarrow $ Number of ways in which the remaining 7 letters of the given word can be arranged in 7 boxes = $7!$
So, the correct answer is “Option c”.
Note: Note that here none of the letters were repeating or appearing more than once. In case the letters appear more than once, we divide the total number of arrangements (considering all the letters different) with the product of factorial of number of times each letter is repeated. We use the formulas of permutations and combinations for the processes of arrangement and selection respectively.
Complete step by step answer:
Here we are provided with the word EQUATION and we are asked to find the number of 8 letters words that can be formed using the letters present in the word such that the first letter is always T.
Now, we can see that there are 8 different letters in the given word so let us form 8 boxes in which the letters can be filled. The first letter should be T as per the condition given in the question, so let us fill the first box with T. Therefore we have,
T |
Now, we need to fill the remaining 7 boxes with 7 remaining letters of the word. We know that n things can be arranged in $n!$ ways if there are n positions. So we have,
$\Rightarrow $ Number of ways in which the remaining 7 letters of the given word can be arranged in 7 boxes = $7!$
So, the correct answer is “Option c”.
Note: Note that here none of the letters were repeating or appearing more than once. In case the letters appear more than once, we divide the total number of arrangements (considering all the letters different) with the product of factorial of number of times each letter is repeated. We use the formulas of permutations and combinations for the processes of arrangement and selection respectively.
Recently Updated Pages
How many sigma and pi bonds are present in HCequiv class 11 chemistry CBSE
Mark and label the given geoinformation on the outline class 11 social science CBSE
When people say No pun intended what does that mea class 8 english CBSE
Name the states which share their boundary with Indias class 9 social science CBSE
Give an account of the Northern Plains of India class 9 social science CBSE
Change the following sentences into negative and interrogative class 10 english CBSE
Trending doubts
Fill the blanks with the suitable prepositions 1 The class 9 english CBSE
The Equation xxx + 2 is Satisfied when x is Equal to Class 10 Maths
In Indian rupees 1 trillion is equal to how many c class 8 maths CBSE
Which are the Top 10 Largest Countries of the World?
How do you graph the function fx 4x class 9 maths CBSE
Give 10 examples for herbs , shrubs , climbers , creepers
Difference Between Plant Cell and Animal Cell
Difference between Prokaryotic cell and Eukaryotic class 11 biology CBSE
Why is there a time difference of about 5 hours between class 10 social science CBSE