Get Answers to all your Questions

header-bg qa

In how many ways can the letters of the word "ENGINEER" be arranged such that no two E's are together?

Option: 1

64,127,253


Option: 2

39,916,656


Option: 3

44,789,589


Option: 4

48,258,963


Answers (1)

best_answer

To calculate the number of ways the letters of the word "ENGINEER" can be arranged such that no two E's are together, we can treat the three E's as distinct entities (E1, E2, and E3). This allows us to treat the problem as arranging the letters "N, G, I, N, R" along with the three distinct E's.

The word "ENGINEER" has a total of 8 letters, but since the three E's are treated as distinct entities, we have a total of 8 + 3 = 11 objects to arrange.

We can arrange these 11 objects in 11! ways. However, within this arrangement, we have to account for the cases where the E's are together.

Consider the three E's as a single entity. We can arrange these 4 entities ("ENG1, N, G, R") in 4! ways. Within each of these arrangements, the three E's can be rearranged among themselves in 3! ways.

Therefore, the total number of arrangements where no two E's are together is given by:

11 !-(4 ! \times 3 !)=39,916,800-(24 \times 6)=39,916,800-144=39,916,656.

Thus, there are 39,916,656 ways to arrange the letters of the word "ENGINEER" such that no two E's are together.

 

Posted by

Pankaj

View full answer

JEE Main high-scoring chapters and topics

Study 40% syllabus and score up to 100% marks in JEE