12.1 Letter Sequences & Positional Shift Rules

In the Verbal Reasoning section of the ISEB Common Pre-Test, letter sequences and positional shift questions assess your cognitive agility, working memory, and pattern-recognition speed. Unlike vocabulary questions that test word definitions, letter-code problems treat language as an alphanumeric system governed by rigorous mathematical rules. With only 25 minutes allocated to the entire Verbal Reasoning module, there is no fixed published allowance per question. Navigating these items quickly and accurately requires replacing mental guesswork with systematic scratch-paper techniques.

---

The Alphabet as a Cyclical System

The English alphabet consists of 26 letters. On standard school entrance assessments, the alphabet is frequently treated as a continuous loop (modular arithmetic modulo 26). When the instruction or supplied pattern uses a cyclical alphabet, reaching the end wraps back to the beginning. Do not impose wrap-around on a puzzle that defines a different rule:

$$\dots \to X \to Y \to Z \to A \to B \to C \to \dots$$

Forward and Backward Wrap-Around Rules

• Forward Wrapping ($+n$): Advancing past $Z$ wraps to $A$. If you are at letter $Y$ (position 25) and must add $+3$: $$25 + 3 = 28 \implies 28 - 26 = 2 \implies B$$
• Backward Wrapping ($-n$): Moving backward past $A$ wraps to $Z$. If you are at letter $B$ (position 2) and must subtract $-4$: $$2 - 4 = -2 \implies 26 - 2 = 24 \implies X$$

The "Step 0" Scratch-Paper Strategy

Before answering your first question during the Verbal Reasoning test, if useful, use rough paper at a time permitted by the invigilator to write out the full alphabet with forward and reverse indices. Having this table physically in front of you prevents finger-counting mistakes and eliminates cognitive fatigue.

---

Single-Letter Sequence Archetypes

Single-letter sequences present a string of individual letters linked by a mathematical progression. To find the missing term, convert the letters to their numerical positions and identify the governing rule.

┌────────────────────────────────────────────────────────┐
│            Single-Letter Sequence Types                │
├──────────────────────────┬─────────────────────────────┤
│ 1. Constant Shifts       │ +3, +3, +3... or -4, -4...  │
│ 2. Accelerating Shifts   │ +1, +2, +3, +4, +5...       │
│ 3. Alternating Shifts    │ +3, -1, +3, -1, +3...       │
│ 4. Interleaved Series    │ Two independent series interwoven│
│ 5. Number-Theoretic      │ Prime steps (+2, +3, +5, +7)│
└──────────────────────────┴─────────────────────────────┘

1. Constant Shifts

A fixed value is added or subtracted at each step.

• Example: $C, F, I, L, O, [?]$
• Numerical conversion: $3, 6, 9, 12, 15$
• Rule: $+3$ each time
• Next value: $15 + 3 = 18 \implies R$

2. Accelerating and Decelerating Shifts

The step size increases or decreases in a regular arithmetic progression.

• Example: $B, C, E, H, L, [?]$
• Numerical conversion: $2, 3, 5, 8, 12$
• Difference vector: $+1, +2, +3, +4$
• Next shift: $+5$
• Next value: $12 + 5 = 17 \implies Q$

3. Alternating Shifts

The operation alternates between two distinct shift values, often switching between addition and subtraction.

• Example: $D, G, F, I, H, K, [?]$
• Numerical conversion: $4, 7, 6, 9, 8, 11$
• Difference vector: $+3, -1, +3, -1, +3$
• Next shift: $-1$
• Next value: $11 - 1 = 10 \implies J$

4. Interleaved (Dual) Sequences

Two independent sequences are woven together alternately. If a sequence oscillates erratically without a clear single-step pattern, test alternating elements:

• Example: $A, Z, C, X, E, V, [?]$
• Odd positions ($1^{\text{st}}, 3^{\text{rd}}, 5^{\text{th}}, 7^{\text{th}}$): $A(1) \xrightarrow{+2} C(3) \xrightarrow{+2} E(5) \xrightarrow{+2} G(7)$
• Even positions ($2^{\text{nd}}, 4^{\text{th}}, 6^{\text{th}}$): $Z(26) \xrightarrow{-2} X(24) \xrightarrow{-2} V(22)$
• Missing term: The 7th position belongs to the odd series, so the answer is $G$.

5. Number-Theoretic Shifts (Primes, Squares, Fibonacci)

Advanced selective entrance papers include sequences governed by mathematical properties:

• Prime number shifts: $+2, +3, +5, +7, +11$
• Square number shifts: $+1, +4, +9, +16$
• Fibonacci shifts: $+1, +1, +2, +3, +5, +8$

---

Multi-Letter Pairs and Triplet Sequences

Many Verbal Reasoning questions present terms containing two or three letters (e.g., $AZ, CX, EV, GT$). When approaching multi-letter terms, try checking positions separately before considering a rule acting on the whole block. Instead, analyze each positional stream independently.

Loading diagram...

Worked Example 1: Two-Letter Pair Progression

Problem: Find the next pair in the series: $DW, GT, JQ, MN, [?]$

Step-by-step Solution:

1. Track the first letters independently: $$D(4) \to G(7) \to J(10) \to M(13)$$
   • Shift rule: $+3, +3, +3$
   • Next first letter: $13 + 3 = 16 \implies P$
2. Track the second letters independently: $$W(23) \to T(20) \to Q(17) \to N(14)$$
   • Shift rule: $-3, -3, -3$
   • Next second letter: $14 - 3 = 11 \implies K$
3. Combine the letters: The next term is $PK$.
4. Verify reverse symmetry: $D(4) + W(23) = 27$; $G(7) + T(20) = 27$; $J(10) + Q(17) = 27$; $M(13) + N(14) = 27$. For our answer, $P(16) + K(11) = 27$. The symmetrical property confirms the answer beyond doubt.

Worked Example 2: Triplet Progression with Wrap-Around

Problem: Find the next letter group in the series: $YAC, WCE, UEG, SGI, [?]$

Step-by-step Solution:

1. First letter stream: $$Y(25) \to W(23) \to U(21) \to S(19)$$
   • Shift: $-2$ each step.
   • Next first letter: $19 - 2 = 17 \implies Q$.
2. Second letter stream: $$A(1) \to C(3) \to E(5) \to G(7)$$
   • Shift: $+2$ each step.
   • Next second letter: $7 + 2 = 9 \implies I$.
3. Third letter stream: $$C(3) \to E(5) \to G(7) \to I(9)$$
   • Shift: $+2$ each step.
   • Next third letter: $9 + 2 = 11 \implies K$.
4. Combine the resulting letters: The missing triplet is $QIK$.

---

Reverse Alphabet Pairings & Symmetry Mnemonics

In reverse-alphabet ciphers, letters are paired by mirror symmetry across the midpoint of the alphabet ($M/N$). Memorizing memorable associative anchors allows rapid retrieval without counting backward from 26:

• A – Z: Amazon / A to Z
• B – Y: By-e (Bye)
• C – X: Crux / Christmas (Xmas)
• D – W: Door Window
• E – V: EVening / EVery
• F – U: FUll / FUn
• G – T: Great / Grand Trunk
• H – S: High School
• I – R: Indian Railway
• J – Q: Jack and Queen
• K – P: King Potter / Kangaroos Play
• L – O: LOve
• M – N: MooN / MaN

When a question pairs letters whose indices sum to 27 ($A \leftrightarrow Z$, $B \leftrightarrow Y$, etc.), these mnemonics provide instant verification.

---

Letter-Group Analogies

Letter-group analogies test whether you can extract the exact transformation vector between an initial pair of letter groups and apply that identical vector to a target group:

$$\text{Group 1} : \text{Group 2} :: \text{Group 3} : [?]$$

Worked Example 3: Transformation Vector Deduction

Problem: $BDF$ is to $HJL$ as $MOQ$ is to $[?]$

Step-by-step Solution:

1. Determine the positional index for each letter in the first pair:
   • $B(2) \to H(8) \implies +6$
   • $D(4) \to J(10) \implies +6$
   • $F(6) \to L(12) \implies +6$
2. Express the transformation vector: $$\vec{V} = [+6, +6, +6]$$
3. Apply the vector to the target group ($MOQ$):
   • First letter: $M(13) + 6 = 19 \implies S$
   • Second letter: $O(15) + 6 = 21 \implies U$
   • Third letter: $Q(17) + 6 = 23 \implies W$
4. Synthesize the answer: $MOQ$ transforms into $SUW$.

---

Common Traps and Timing Techniques