Consider all possible permutations of...

MathematicsLinear PermutationsJEE Advanced 2008Moderate

View in:English Hindi

Consider all possible permutations of the letters of the word ENDEANOEL. Match the Statements / Expressions in Column I with the Statements / Expressions in Column II and indicate your answer by darkening the appropriate bubbles in the $4 \times 4$ matrix given in the ORS.

List-I

(P)

The number of permutations containing the word ENDEA is

(Q)

The number of permutations in which the letter E occurs in the first and the last positions is

(R)

The number of permutations in which none of the letters D, L, N occurs in the last five positions is

(S)

The number of permutations in which the letters A, E, O occur only in odd positions is

List-II

(1)

5!

(2)

2 \times 5!

(3)

7 \times 5!

(4)

21 \times 5!

Answer:P → 1, Q → 4, R → 2, S → 2

Visualized Solution (Hindi)

Word Analysis

Word: ENDEANOEL
Total letters: $9$
Letter counts: $E : 3, N : 2, D : 1, A : 1, O : 1, L : 1$

Part (A): Word ENDEA as a Block

Treat ENDEA as a single block.
Remaining letters: $N, O, E, L$
Total units to arrange: $1 (block) + 4 (letters) = 5$
Number of ways = $5!$
Matching: $(A) \to (p)$

Part (B): Fixed E at Ends

Fixed positions: $E_______E$
Remaining letters: $N, D, E, A, N, O, L$ (Total $7$ )
Repetitions: $N$ occurs $2$ times.
Arrangements = $\frac{7 !}{2 !} = \frac{7 \times 6 \times 5 !}{2} = 21 \times 5!$
Matching: $(B) \to (s)$

Part (C): Restrictions on Last 5 Slots

Constraint: $D, L, N, N$ cannot be in positions $5, 6, 7, 8, 9$ .
Therefore, $D, L, N, N$ must occupy positions $1, 2, 3, 4$ .
Arrangement of first 4: $\frac{4 !}{2 !} = 12$
Remaining letters ( $E, E, E, A, O$ ) in last 5: $\frac{5 !}{3 !} = 20$
Total = $12 \times 20 = 240 = 2 \times 5!$
Matching: $(C) \to (q)$

Part (D): A, E, O at Odd Positions

Odd positions: $1, 3, 5, 7, 9$ ( $5$ slots)
Letters for odd slots: $A, E, E, E, O$ (Total $5$ )
Arrangement (Odd): $\frac{5 !}{3 !} = 20$
Letters for even slots ( $2, 4, 6, 8$ ): $N, N, D, L$
Arrangement (Even): $\frac{4 !}{2 !} = 12$
Total = $20 \times 12 = 240 = 2 \times 5!$
Matching: $(D) \to (q)$

Final Conclusion

Final Matchings:
$(A) \to (p)$
$(B) \to (s)$
$(C) \to (q)$
$(D) \to (q)$
Key Takeaway: Handle restricted positions or blocks first before arranging the rest.

00:00 / 00:00

Conceptually Similar Problems

MathematicsLinear PermutationsJEE Advanced 2002Easy

View in:English Hindi

The number of arrangements of the letters of the word BANANA in which the two N's do not appear adjacently is

(A)

(B)

(C)

(D)

100

Answer:A

MathematicsLinear PermutationsJEE Main 2004Easy

View in:English Hindi

How many ways are there to arrange the letters in the word GARDEN with vowels in alphabetical order

(A)

480

(B)

240

(C)

360

(D)

120

Answer:C

MathematicsFundamental Principle of CountingJEE Advanced 1982Easy

View in:English Hindi

Ten different letters of an alphabet are given. Words with five letters are formed from these given letters. Then the number of words which have at least one letter repeated are

(A)

69760

(B)

30240

(C)

99748

(D)

none of these

Answer:A

MathematicsLinear PermutationsJEE Main 2009Moderate

View in:English Hindi

How many different words can be formed by jumbling the letters in the word MISSISSIPPI in which no two S are adjacent?

(A)

8 \cdot ^6C_4 \cdot ^7C_4

(B)

6 \cdot 7 \cdot ^8C_4

(C)

6 \cdot 8 \cdot ^7C_4

(D)

7 \cdot ^6C_4 \cdot ^8C_4

Answer:D

MathematicsDerangement PrincipleJEE Advanced 2014Moderate

View in:English Hindi

Six cards and six envelopes are numbered 1, 2, 3, 4, 5, 6 and cards are to be placed in envelopes so that each envelope contains exactly one card and no card is placed in the envelope bearing the same number and moreover the card numbered 1 is always placed in envelope numbered 2. Then the number of ways it can be done is

(A)

264

(B)

265

(C)

(D)

Answer:C

MathematicsCombinations and SelectionJEE Advanced 2014Easy

View in:English Hindi

Let $n_{1} < n_{2} < n_{3} < n_{4} < n_{5}$ be positive integers such that $n_{1} + n_{2} + n_{3} + n_{4} + n_{5} = 20$ . Then the number of such distinct arrangements $(n_{1}, n_{2}, n_{3}, n_{4}, n_{5})$ is

Answer:7

MathematicsFundamental Principle of CountingJEE Main 2002Easy

View in:English Hindi

Total number of four digit odd numbers that can be formed using 0, 1, 2, 3, 5, 7 (using repetition allowed) are

(A)

216

(B)

375

(C)

400

(D)

720

Answer:D

MathematicsLinear PermutationsJEE Advanced 2004Moderate

View in:English Hindi

Prove by permutation or otherwise $\frac{( n ^{2} )!}{( n ! ) ^{n}}$ is an integer ( $n \in I^{+}$ ).

MathematicsFundamental Principle of CountingJEE Main 2012Easy

View in:English Hindi

Let $X = {1, 2, 3, 4, 5}$ . The number of different ordered pairs (Y,Z) that can formed such that $Y \subseteq X, Z \subseteq X$ and $Y \cap Z$ is empty is:

(A)

5²

(B)

3⁵

(C)

2⁵

(D)

5³

Answer:B

MathematicsCircular PermutationsJEE Main 2003Easy

View in:English Hindi

The number of ways in which 6 men and 5 women can dine at a round table if no two women are to sit together is given by

(A)

7! \times 5!

(B)

6! \times 5!

(C)

30!

(D)

5! \times 4!

Answer:B

List-I

List-II

Visualized Solution (Hindi)

Word Analysis

Part (A): Word ENDEA as a Block

Part (B): Fixed E at Ends

Part (C): Restrictions on Last 5 Slots

Part (D): A, E, O at Odd Positions

Final Conclusion

Conceptually Similar Problems

The number of arrangements of the letters of the word BANANA in which the two N's do not appear adjacently is

How many ways are there to arrange the letters in the word GARDEN with vowels in alphabetical order

Ten different letters of an alphabet are given. Words with five letters are formed from these given letters. Then the number of words which have at least one letter repeated are

How many different words can be formed by jumbling the letters in the word MISSISSIPPI in which no two S are adjacent?

Total number of four digit odd numbers that can be formed using 0, 1, 2, 3, 5, 7 (using repetition allowed) are

.math-text-wrapper .katex { font-size: 1.05em !important; } .math-text-wrapper .katex-display { margin: 1rem 0 !important; } Prove by permutation or otherwise (n!)n(n2)!​ is an integer (n∈I+).

.math-text-wrapper .katex { font-size: 1.05em !important; } .math-text-wrapper .katex-display { margin: 1rem 0 !important; } Let X={1,2,3,4,5}. The number of different ordered pairs (Y,Z) that can formed such that Y⊆X,Z⊆X and Y∩Z is empty is:

The number of ways in which 6 men and 5 women can dine at a round table if no two women are to sit together is given by

List-I

List-II

The number of arrangements of the letters of the word BANANA in which the two N's do not appear adjacently is

How many ways are there to arrange the letters in the word GARDEN with vowels in alphabetical order

Ten different letters of an alphabet are given. Words with five letters are formed from these given letters. Then the number of words which have at least one letter repeated are

How many different words can be formed by jumbling the letters in the word MISSISSIPPI in which no two S are adjacent?

Total number of four digit odd numbers that can be formed using 0, 1, 2, 3, 5, 7 (using repetition allowed) are

.math-text-wrapper .katex { font-size: 1.05em !important; } .math-text-wrapper .katex-display { margin: 1rem 0 !important; } Prove by permutation or otherwise (n!)n(n2)!​ is an integer (n∈I+).

.math-text-wrapper .katex { font-size: 1.05em !important; } .math-text-wrapper .katex-display { margin: 1rem 0 !important; } Let X={1,2,3,4,5}. The number of different ordered pairs (Y,Z) that can formed such that Y⊆X,Z⊆X and Y∩Z is empty is:

The number of ways in which 6 men and 5 women can dine at a round table if no two women are to sit together is given by

Prove by permutation or otherwise $\frac{( n ^{2} )!}{( n ! ) ^{n}}$ is an integer ( $n \in I^{+}$ ).

Let $X = {1, 2, 3, 4, 5}$ . The number of different ordered pairs (Y,Z) that can formed such that $Y \subseteq X, Z \subseteq X$ and $Y \cap Z$ is empty is:

Prove by permutation or otherwise $\frac{( n ^{2} )!}{( n ! ) ^{n}}$ is an integer ( $n \in I^{+}$ ).

Let $X = {1, 2, 3, 4, 5}$ . The number of different ordered pairs (Y,Z) that can formed such that $Y \subseteq X, Z \subseteq X$ and $Y \cap Z$ is empty is: