3.2 Letter Series

Letter series items sit beside number series in NMAT Inductive Reasoning. The cognitive skill is the same—infer a general rule from incomplete information—but the raw material is the English alphabet. Students who “stare at letters” waste time. Students who convert to positions finish faster and with fewer wrap-around errors.

This section covers alphabet positions, skip and reverse patterns, vowel/consonant filters, paired letters, the position-number conversion technique, fully worked examples, and the traps that appear when Z wraps to A inconsistently.

Alphabet Positions (Memorize Cold)

Treat the alphabet as a number line:

Anchors to memorize for speed: A=1, E=5, J=10, M=13, N=14, T=20, Z=26. From these anchors you can count quickly in either direction without reciting the entire alphabet every time.

Position-Number Conversion Technique

For any letter series:

1. Write positions under each letter.
2. Solve as a number series (constant difference, alternating differences, two interleaved sequences, etc.).
3. Convert the next number back to a letter.
4. Check wrap rules: if a step goes past 26 or below 1, decide whether modular wrap (27→1=A, 0→26=Z) is part of the rule—only if it fits every step consistently.

Example conversion:

Series: B, E, H, K, __

Positions: 2, 5, 8, 11 → +3 each time → next position 14 → N.

You never needed to “think in letters” after step 1.

Pattern Families for Letters

1. Constant skip (arithmetic on positions)

Skip of k means each step adds k to the position (or subtracts k going backward).

• +1: A, B, C, D (no skip between consecutive letters)
• +2: A, C, E, G (skip one letter each time)
• +3: A, D, G, J

Language note: “skip one letter” usually means difference of 2 in position (A→C), not difference of 1.

2. Reverse alphabet / decreasing positions

Example: Z, X, V, T, __ → positions 26, 24, 22, 20 → −2 → next 18 → R.

3. Growing or shrinking skips

Differences themselves form a pattern.

Example: A, C, F, J, O, __

Positions: 1, 3, 6, 10, 15 → differences +2, +3, +4, +5 → next difference +6 → position 21 → U.

This is the letter analogue of a non-constant first-difference number series.

4. Vowel and consonant patterns

Vowels in order: A, E, I, O, U (sometimes Y is treated as vowel—almost never assume Y is a vowel on NMAT-style items unless the series only works that way).

Example: A, E, I, O, __ → next vowel U.

Consonant-only walks skip vowels:

Example: B, C, D, F, G, H, J, __ → after H the next consonants continue; if the rule is “list consonants in order,” next after J is K, but if a skip pattern is layered on consonants only, convert the consonant list to an index sequence first.

5. Paired letters

Terms may be pairs treated as units: AB, CD, EF, GH, __ → IJ.

Or pairs with an internal rule: AZ, BY, CX, DW, __ → positions (1,26), (2,25), (3,24), (4,23) → next (5,22) → EV.

Paired items reward writing two position streams.

6. Interleaved (alternating) letter streams

Exactly like alternating number series: odd positions follow one rule, even positions another.

Example: A, Z, B, Y, C, X, __

• Odd: A, B, C → next odd D
• Even: Z, Y, X → next even W

If the blank is the 7th term (odd), answer is D.

Worked Examples

Worked example 1 — forward constant skip

Series: D, G, J, M, __

Positions: 4, 7, 10, 13 → +3 → next 16 → P.

Distractors: O (only +2 from M), N (+1), Q (+4). Only +3 fits all steps.

Worked example 2 — reverse with constant skip

Series: U, R, O, L, __

Positions: 21, 18, 15, 12 → −3 → next 9 → I.

Distractors: J (−2), H (−4), K (reverse alphabet one step from L without the skip pattern).

Worked example 3 — growing skips

Series: B, D, G, K, P, __

Positions: 2, 4, 7, 11, 16 → Δ +2, +3, +4, +5 → next Δ +6 → 22 → V.

Distractors: U (next Δ +5 repeated), W (+7), Q (alphabetical neighbor thinking).

Worked example 4 — interleaved forward and reverse

Series: A, Z, C, X, E, V, __

• Odd positions: A, C, E → +2 → next odd G (7th term)
• Even positions: Z, X, V → −2 → would continue to T

Distractors: T (continuing the even stream), F (+1 on odds), Y (random reverse neighbor).

Worked example 5 — paired opposite letters

Series: AY, BX, CW, DV, __

First letters: A,B,C,D → +1 → E
Second letters: Y,X,W,V → −1 → U
Next pair: EU.

Distractors: ET, FU, EW—each applies the correct rule to only one letter of the pair.

Worked example 6 — wrap-around done consistently

Series: X, A, D, G, __

Positions: 24, 1, 4, 7. From 24, +3 wraps: 24+3=27 → 27−26=1 (A). Then +3 each time. Next: 7+3=10 → J.

The wrap is valid because every step is +3 in modular 26 arithmetic. If only one step “magically” wrapped and others did not share the same modular rule, reject wrap as the explanation.

Traps: Skipping Wrap from Z to A Inconsistently

This is the highest-yield letter-series trap.

Inconsistent wrap (wrong):

Someone sees Y, Z, A and assumes “always wrap,” then applies wrap later when a simple −1 or +1 without modular logic fits better—or applies wrap only when stuck.

Consistent modular rule (right):

If the rule is “+3 mod 26,” then every step must equal +3 after converting positions, including those that cross Z→A.

Checklist when Z/A appear:

1. Convert all terms to positions first.
2. Compute differences without wrap; see if a clean pattern exists in raw integers (sometimes the series never needs wrap because it stays mid-alphabet).
3. If a jump like 25 → 2 appears, test whether the same modular difference appears at other steps.
4. Never wrap on only one step to force an option to fit.
5. Watch options that are one letter off due to off-by-one skip counting (“skip two letters” vs position +2).

Other frequent traps

Speed Tips for the Subtest

• Pre-write A=1…Z=26 once on scratch paper at the start of Inductive Reasoning if you are not fully automatic—then reuse it for all letter items.
• After conversion, reuse number-series habits: difference table, alternating split, verify on all terms.
• Target similar timing to easy number series (~45–60 seconds) when the pattern is a constant skip; allow a bit more for interleaved or paired items.
• If two options both “look alphabetical,” regenerate the entire series from your candidate rule—only one rule will survive all terms.

Letter series are not a separate talent. They are number series written in base-26 labels. Convert, compute, convert back, and demand consistency—especially at the Z/A boundary.