Answer
Verified
455.4k+ views
Hint: Here we will use permutation to find number of ways in which all \[8\] letters can be arranged and then subtract number of ways in which \[A,B,C,D\] are in alphabetical order but \[A,B,C,D,E\] are not in alphabetical order. In one case we take \[(A,B,C,D)\] as one letter and \[E,F,G,H\] as separate letters, in other case we take \[(A,B,C,D,E)\] as one letter and \[F,G,H\] as separate letters.
Complete step-by-step answer:
Given, \[8\] letters \[A,B,C,D,E,F,G,H\]
To find number of ways in which 8 letters \[A,B,C,D,E,F,G,H\] are arranged such that \[A,B,C,D\] are always in alphabetical order, we consider \[(A,B,C,D)\] as one letter and \[E,F,G,H\] as other \[4\] different letters.
Therefore, we have total \[5\] letters that have to be arranged.
We use the formula of permutation to find number of possible ways of arrangement of \[n\] letters
ie; If number of letters \[ = n\] , then number of possible ways to arrange \[n\] letters \[ = n!\]
where; \[n! = n \times (n - 1) \times (n - 2) \times ............. \times 3 \times 2 \times 1\]
So, number of ways in which \[5\] letters (where \[(A,B,C,D)\] is one letter) can be arranged \[ = 5!\]
Ie; \[5! = (5) \times (4) \times (3) \times (2) \times (1) = 120\]
Thus, there are \[120\] ways to arrange 8 letters \[A,B,C,D,E,F,G,H\] such that \[A,B,C,D\] are always in alphabetical order. \[.........(i)\]
Now, to find number of ways in which 8 letters \[A,B,C,D,E,F,G,H\] are arranged such that \[A,B,C,D,E\] are always in alphabetical order, we consider \[(A,B,C,D,E)\] as one letter and \[F,G,H\] as other \[3\] different letters.
Therefore, we have total \[4\] letters that have to be arranged.
We use the formula of permutation to find number of possible ways of arrangement of \[n\] letters
ie; If number of letters \[ = n\] , then number of possible ways to arrange \[n\] letters \[ = n!\]
where; \[n! = n \times (n - 1) \times (n - 2) \times ............. \times 3 \times 2 \times 1\]
So, number of ways in which \[4\] letters (where \[(A,B,C,D,E)\] is one letter) can be arranged \[ = 4!\]
Ie; \[4! = (4) \times (3) \times (2) \times (1) = 24\]
Thus, there are \[24\] ways to arrange 8 letters \[A,B,C,D,E,F,G,H\] such that \[A,B,C,D,E\] are always in alphabetical order. \[.........(ii)\]
Thus, number of ways in which \[8\] letters \[A,B,C,D,E,F,G,H\] are arranged in a row such that \[A,B,C,D\] are in alphabetical order but \[A,B,C,D,E\] are not in alphabetical order \[ = N\]
Ie; Number of ways in which 8 letters \[A,B,C,D,E,F,G,H\] are arranged such that \[A,B,C,D\] are always in alphabetical order \[ - \] number of ways in which 8 letters \[A,B,C,D,E,F,G,H\] are arranged such that \[A,B,C,D,E\] are always in alphabetical order \[ = N\]
Ie; \[N = equation(i) - equation(ii)\]
Ie; \[N = 120 - 24\]
Ie; \[N = 96\] \[.........(iii)\]
Now, to find the value of \[(1350 - N)\] , we substitute the value of \[N = 96\] from \[equation(iii)\] ;
Ie; \[(1350 - N) = (1350 - 96) = 1254\]
Therefore; the value of \[(1350 - N) = 1254\]
Note: In these types of questions, we always try to pair up the letters that have to be in alphabetical order and then we add or subtract according to the requirement.
Alternative method: \[N = \] number of ways in which 8 letters \[A,B,C,D,E,F,G,H\] are arranged such that \[A,B,C,D\] are always in alphabetical order \[ - \] number of ways in which 8 letters \[A,B,C,D,E,F,G,H\] are arranged such that \[A,B,C,D,E\] are always in alphabetical order i.e. \[N = 5! - 4! = (5 \times 4 \times 3 \times 2 \times 1) - (4 \times 3 \times 2 \times 1) = 120 - 24 = 96\]
Complete step-by-step answer:
Given, \[8\] letters \[A,B,C,D,E,F,G,H\]
To find number of ways in which 8 letters \[A,B,C,D,E,F,G,H\] are arranged such that \[A,B,C,D\] are always in alphabetical order, we consider \[(A,B,C,D)\] as one letter and \[E,F,G,H\] as other \[4\] different letters.
Therefore, we have total \[5\] letters that have to be arranged.
We use the formula of permutation to find number of possible ways of arrangement of \[n\] letters
ie; If number of letters \[ = n\] , then number of possible ways to arrange \[n\] letters \[ = n!\]
where; \[n! = n \times (n - 1) \times (n - 2) \times ............. \times 3 \times 2 \times 1\]
So, number of ways in which \[5\] letters (where \[(A,B,C,D)\] is one letter) can be arranged \[ = 5!\]
Ie; \[5! = (5) \times (4) \times (3) \times (2) \times (1) = 120\]
Thus, there are \[120\] ways to arrange 8 letters \[A,B,C,D,E,F,G,H\] such that \[A,B,C,D\] are always in alphabetical order. \[.........(i)\]
Now, to find number of ways in which 8 letters \[A,B,C,D,E,F,G,H\] are arranged such that \[A,B,C,D,E\] are always in alphabetical order, we consider \[(A,B,C,D,E)\] as one letter and \[F,G,H\] as other \[3\] different letters.
Therefore, we have total \[4\] letters that have to be arranged.
We use the formula of permutation to find number of possible ways of arrangement of \[n\] letters
ie; If number of letters \[ = n\] , then number of possible ways to arrange \[n\] letters \[ = n!\]
where; \[n! = n \times (n - 1) \times (n - 2) \times ............. \times 3 \times 2 \times 1\]
So, number of ways in which \[4\] letters (where \[(A,B,C,D,E)\] is one letter) can be arranged \[ = 4!\]
Ie; \[4! = (4) \times (3) \times (2) \times (1) = 24\]
Thus, there are \[24\] ways to arrange 8 letters \[A,B,C,D,E,F,G,H\] such that \[A,B,C,D,E\] are always in alphabetical order. \[.........(ii)\]
Thus, number of ways in which \[8\] letters \[A,B,C,D,E,F,G,H\] are arranged in a row such that \[A,B,C,D\] are in alphabetical order but \[A,B,C,D,E\] are not in alphabetical order \[ = N\]
Ie; Number of ways in which 8 letters \[A,B,C,D,E,F,G,H\] are arranged such that \[A,B,C,D\] are always in alphabetical order \[ - \] number of ways in which 8 letters \[A,B,C,D,E,F,G,H\] are arranged such that \[A,B,C,D,E\] are always in alphabetical order \[ = N\]
Ie; \[N = equation(i) - equation(ii)\]
Ie; \[N = 120 - 24\]
Ie; \[N = 96\] \[.........(iii)\]
Now, to find the value of \[(1350 - N)\] , we substitute the value of \[N = 96\] from \[equation(iii)\] ;
Ie; \[(1350 - N) = (1350 - 96) = 1254\]
Therefore; the value of \[(1350 - N) = 1254\]
Note: In these types of questions, we always try to pair up the letters that have to be in alphabetical order and then we add or subtract according to the requirement.
Alternative method: \[N = \] number of ways in which 8 letters \[A,B,C,D,E,F,G,H\] are arranged such that \[A,B,C,D\] are always in alphabetical order \[ - \] number of ways in which 8 letters \[A,B,C,D,E,F,G,H\] are arranged such that \[A,B,C,D,E\] are always in alphabetical order i.e. \[N = 5! - 4! = (5 \times 4 \times 3 \times 2 \times 1) - (4 \times 3 \times 2 \times 1) = 120 - 24 = 96\]
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
Which are the Top 10 Largest Countries of the World?
Fill the blanks with the suitable prepositions 1 The class 9 english CBSE
Difference Between Plant Cell and Animal Cell
Differentiate between homogeneous and heterogeneous class 12 chemistry CBSE
Give 10 examples for herbs , shrubs , climbers , creepers
Difference between Prokaryotic cell and Eukaryotic class 11 biology CBSE
Is the correct possessive form of Boss Bosss or Boss class 7 english CBSE
The Equation xxx + 2 is Satisfied when x is Equal to Class 10 Maths
How do you graph the function fx 4x class 9 maths CBSE