Find Dictionary Rank of Any Word in 15 Seconds: NIMCET P&C Shortcut Tricks

In the NIMCET (NIT MCA Common Entrance Test) Mathematics section, Permutations and Combinations (P&C) is a core topic contributing 3 to 5 questions (worth 36 to 60 marks). Among P&C problem types, finding the Dictionary Rank of a Word (e.g., finding the position of words like "NIMCET", "MASTER", or "SUCCESS" when all permutations are arranged alphabetically) is a recurring favorite.

Using the classical alphabetical elimination method takes 3 to 4 minutes per question and involves tedious addition prone to calculation mistakes under exam pressure.

With the Factoriometric Shortcut Trick, you can determine the exact dictionary rank of ANY word—whether containing distinct letters or repeating letters—in under 15 seconds!

1. Classical Method vs The 15-Second Factoriometric Shortcut

Why the Traditional Method Fails in NIMCET:

The traditional textbook method requires listing all alphabetical permutations starting with preceding letters, calculating factorials for each block, and adding them up. For a 6-letter word like "NIMCET", this involves 5 separate factorial addition steps. In a timed test where you have only 1.4 minutes per math question, spending 4 minutes on one problem hurts performance.

The Factoriometric Shortcut Advantage:

• Speed: Solves any 6 or 7-letter word in 15 to 20 seconds.
• Accuracy: Uses a single positional multiplication line, eliminating manual block additions.
• Universal Application: Works seamlessly for words with distinct letters AND words with repeating letters.

2. Shortcut Method for Words with DISTINCT Letters

Let's understand the 4-step algorithm using the word "NIMCET".

Step-by-Step Algorithm:

1. Write the word and assign Alphabetical Ranks (0-indexed):

   • Arrange the letters of the given word alphabetically: C(0), E(1), I(2), M(3), N(4), T(5)
   • Assign these numerical ranks above the letters in the given word: $\begin{matrix} N & I & M & C & E & T \\ 4 & 2 & 3 & 0 & 1 & 5 \end{matrix}$

2. Count Smaller Ranks to the Right: For each letter, count how many numbers to its RIGHT are strictly SMALLER than its own rank:

   • For N (4): Numbers to right are 2, 3, 0, 1, 5. Smaller than 4 are 2, 3, 0, 1 (Count = 4).
   • For I (2): Numbers to right are 3, 0, 1, 5. Smaller than 2 are 0, 1 (Count = 2).
   • For M (3): Numbers to right are 0, 1, 5. Smaller than 3 are 0, 1 (Count = 2).
   • For C (0): Numbers to right are 1, 5. Smaller than 0 is none (Count = 0).
   • For E (1): Numbers to right is 5. Smaller than 1 is none (Count = 0).
   • For T (5): No numbers to right (Count = 0).

   Sequence of Counts: [4, 2, 2, 0, 0, 0]

3. Multiply by Decreasing Factorials ($5!, 4!, 3!, 2!, 1!, 0!$): Attach factorial weights starting from $(n-1)!$ down to $0!$ from left to right: $\text{Value} = (4 \times 5!) + (2 \times 4!) + (2 \times 3!) + (0 \times 2!) + (0 \times 1!) + (0 \times 0!)$

   $\text{Value} = (4 \times 120) + (2 \times 24) + (2 \times 6) + 0 + 0 + 0 = 480 + 48 + 12 = 540$

4. Add +1 for Final Rank: $\text{Dictionary Rank} = \text{Value} + 1 = 540 + 1 = \mathbf{541}$

The dictionary rank of the word "NIMCET" is 541!

3. Shortcut Method for Words with REPEATING Letters

When a word contains repeating letters (e.g., "SUCCESS"), we modify Step 3 by dividing each term by the factorial of duplicate counts of letters remaining to the right (including the current letter).

Example: Find the Dictionary Rank of "SUCCESS"

Letters: S, U, C, C, E, S, S (Total 7 letters) Alphabetical Order: C(0), C(0), E(1), S(2), S(2), S(2), U(3)

1. Assign Ranks: $\begin{matrix} S & U & C & C & E & S & S \\ 2 & 3 & 0 & 0 & 1 & 2 & 2 \end{matrix}$

2. Count Smaller Ranks to Right & Divide by Repetition Factorials:

   • 1st letter S (rank 2):

     • Numbers to right smaller than 2: C(0), C(0), E(1) $\rightarrow$ 3 numbers.
     • Remaining letters from this position to end: 3 S's, 2 C's, 1 E, 1 U.
     • Repetitions: 3 S's ($3!$), 2 C's ($2!$).
     • Value 1 = $3 \times \frac{6!}{3! \times 2!} = 3 \times \frac{720}{12} = 3 \times 60 = 180$.

   • 2nd letter U (rank 3):

     • Numbers to right smaller than 3: C(0), C(0), E(1), S(2), S(2) $\rightarrow$ 5 numbers.
     • Remaining letters: 2 C's ($2!$), 2 S's ($2!$).
     • Value 2 = $5 \times \frac{5!}{2! \times 2!} = 5 \times \frac{120}{4} = 5 \times 30 = 150$.

   • 3rd letter C (rank 0):

     • Numbers to right smaller than 0: 0. Value = 0.

   • 4th letter C (rank 0):

     • Numbers to right smaller than 0: 0. Value = 0.

   • 5th letter E (rank 1):

     • Numbers to right smaller than 1: 0. Value = 0.

   • 6th letter S (rank 2):

     • Numbers to right smaller than 2: 0. Value = 0.

   • 7th letter S (rank 2):

     • Numbers to right: 0. Value = 0.

3. Sum and Add +1: $\text{Total Value} = 180 + 150 + 0 + 0 + 0 + 0 + 0 = 330$ $\text{Dictionary Rank} = 330 + 1 = \mathbf{331}$

The dictionary rank of the word "SUCCESS" is 331!

4. Solved NIMCET PYQ Practice Problems

Solved PYQ 1: Rank of the word "MASTER"

Alphabetical Order: A(0), E(1), M(2), R(3), S(4), T(5)

$\begin{matrix} M & A & S & T & E & R \\ 2 & 0 & 4 & 5 & 1 & 3 \end{matrix}$

• M (2): Smaller to right = A(0), E(1) $\rightarrow 2 \times 5! = 2 \times 120 = 240$
• A (0): Smaller to right = None $\rightarrow 0 \times 4! = 0$
• S (4): Smaller to right = E(1), R(3) $\rightarrow 2 \times 3! = 2 \times 6 = 12$
• T (5): Smaller to right = E(1), R(3) $\rightarrow 2 \times 2! = 2 \times 2 = 4$
• E (1): Smaller to right = None $\rightarrow 0 \times 1! = 0$
• R (3): $0 \times 0! = 0$

$\text{Sum} = 240 + 0 + 12 + 4 + 0 + 0 = 256$ $\text{Rank} = 256 + 1 = \mathbf{257}$

Frequently Asked Questions (FAQ)

Q1: Why do we add +1 at the end when calculating dictionary rank?

We add +1 at the end because the factorial sum calculation counts the number of words that appear before the given word in alphabetical order. Adding +1 gives the exact position (rank) of the word itself.

Q2: Does this shortcut trick work for all standard NIMCET P&C word rank questions?

Yes, the factoriometric shortcut works for all words, regardless of length, whether they contain distinct letters or repeating letters.

Q3: How do we handle duplicate letters when using the factoriometric shortcut?

When letters repeat, divide each position's factorial weight by the factorials of the frequencies of all repeating letters occurring from that position to the end of the word.

Q4: How many P&C questions are asked in the NIMCET Mathematics section?

Permutations and Combinations contributes 3 to 5 questions (36 to 60 marks) out of 50 questions in the Mathematics section of NIMCET.