Study guide

12.1 Letter Sequences & Positional Shift Rules

ISEB Common Pre-Tests Study Guide 2026 Exam

Track your progress as you read

Finished sections get a check mark.

1 Orientation, Registration & Strategy

1.1 Purpose, Entry Years & Registration 1.2 Scores, Age Standardisation & School Decisions 1.3 Adaptive Delivery & Test-Day Strategy

2 English: Retrieval, Inference & Word Choice

2.1 Information Retrieval & Literal Comprehension 2.2 Inference, Deduction & Authorial Intent 2.3 Vocabulary in Context 2.4 Word Choice & Literary Effects

3 English: Summaries, Comparisons & Word Classes

3.1 Summarising Main Ideas 3.2 Comparisons, Viewpoint & Formality 3.3 Word Classes, Families, Prefixes & Suffixes

4 English: Spelling, Sentences & Punctuation

4.1 Spelling Patterns & Common Exceptions 4.2 Clauses, Sentence Structure, Agreement & Register 4.3 Punctuation, Possession & Direct Speech

5 Mathematics: Place Value & Calculations

5.1 Whole-Number Place Value, Rounding & Roman Numerals 5.2 Decimal Scaling, Ordering & Negative Numbers 5.3 Four Operations & Multi-Step Calculations

6 Mathematics: Factors, Primes, Squares & Cubes

6.1 Factors, Multiples & Prime Numbers 6.2 Squares, Cubes & Optional Order of Operations

7 Mathematics: Fractions & Percentages

7.1 Equivalent Fractions, Mixed Numbers & Comparison 7.2 Fraction Arithmetic & Quantities 7.3 Percentages & Fraction–Decimal Equivalents

8 Mathematics: Scaling, Charts & Tables

8.1 Scaling & Optional Ratio Sharing 8.2 Statistics: Tables, Charts, Line Graphs & Mean

9 Mathematics: Units, Time, Money & Area

9.1 Units, Scales & Approximate Imperial Equivalents 9.2 Time, Timetables & Money 9.3 Perimeter, Rectangular Area & Irregular Estimates

10 Mathematics: Volume, Shapes, Angles & Coordinates

10.1 Volume, Capacity & Optional Packing Extensions 10.2 2D & 3D Shape Properties 10.3 Angles, Coordinates, Translation & Reflection

11 Verbal Reasoning: Vocabulary & Word Relationships

11.1 Advanced Vocabulary, Synonyms & Antonyms 11.2 Word Relationships, Analogies & Odd-One-Out 11.3 Word Building: Hidden Words, Compound Words & Missing Letters

12 Verbal Reasoning: Codes, Sequences & Logic

12.1 Letter Sequences & Positional Shift Rules 12.2 Number-Letter Codes & Substitution Ciphers 12.3 Deductive Logic, Ordering & Relational Problems

13 Non-Verbal Reasoning: 2D Patterns & Codes

13.1 2D Sequences, Series Completion & Progression Rules 13.2 2D Analogies, Similarities & Odd-One-Out 13.3 Matrix Grids & Feature Combination 13.4 Multi-Feature Shape Code Matching

14 Spatial Reasoning: Reflections, Rotations & 3D Views

14.1 Reflections, Mirror Lines & Line Symmetry 14.2 Rotations, Angles of Turn & Directional Orientation 14.3 Cube Nets, Opposite Faces & Folded Orientation 14.4 3D Views, Rotation & Hidden Cubes

12.1 Letter Sequences & Positional Shift Rules

Key Takeaways Explain This Topic AI

Count the jumps between letters rather than counting the start as a jump.

Use a cyclical alphabet only when the instruction or pattern supports it.

Check constant, changing or alternating shifts against all supplied terms.

Notes and alphabet references may be written only when the invigilator permits.

Last updated: October 2026

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.

Important

Letter-sequence questions do not evaluate spelling ability. They test your capability to identify mathematical transformations applied to the alphabet. Always treat letters as numerical positions along a coordinate line from 1 to 26.

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: ⋯ → X → Y → Z → A → B → C → … \dots \to X \to Y \to Z \to A \to B \to C \to \dots ⋯ → X → Y → Z → A → B → C → …

Forward and Backward Wrap-Around Rules

Forward Wrapping ( + n +n + n ): Advancing past Z Z Z wraps to A A A . If you are at letter Y Y Y (position 25) and must add + 3 +3 + 3 : 25 + 3 = 28 ⟹ 28 − 26 = 2 ⟹ B 25 + 3 = 28 \implies 28 - 26 = 2 \implies B 25 + 3 = 28 ⟹ 28 − 26 = 2 ⟹ B

Backward Wrapping ( − n -n − n ): Moving backward past A A A wraps to Z Z Z . If you are at letter B B B (position 2) and must subtract − 4 -4 − 4 : 2 − 4 = − 2 ⟹ 26 − 2 = 24 ⟹ X 2 - 4 = -2 \implies 26 - 2 = 24 \implies X 2 − 4 = − 2 ⟹ 26 − 2 = 24 ⟹ 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.

  • Letter Forward (1–26) Reverse (26–1) Reverse Pair (Sum = 27)
  • A 1 26 A ↔ Z A \leftrightarrow Z A ↔ Z ( 1 + 26 = 27 1 + 26 = 27 1 + 26 = 27 )
  • B 2 25 B ↔ Y B \leftrightarrow Y B ↔ Y ( 2 + 25 = 27 2 + 25 = 27 2 + 25 = 27 )
  • C 3 24 C ↔ X C \leftrightarrow X C ↔ X ( 3 + 24 = 27 3 + 24 = 27 3 + 24 = 27 )
  • D 4 23 D ↔ W D \leftrightarrow W D ↔ W ( 4 + 23 = 27 4 + 23 = 27 4 + 23 = 27 )
  • E 5 22 E ↔ V E \leftrightarrow V E ↔ V ( 5 + 22 = 27 5 + 22 = 27 5 + 22 = 27 )
  • F 6 21 F ↔ U F \leftrightarrow U F ↔ U ( 6 + 21 = 27 6 + 21 = 27 6 + 21 = 27 )
  • G 7 20 G ↔ T G \leftrightarrow T G ↔ T ( 7 + 20 = 27 7 + 20 = 27 7 + 20 = 27 )
  • H 8 19 H ↔ S H \leftrightarrow S H ↔ S ( 8 + 19 = 27 8 + 19 = 27 8 + 19 = 27 )
  • I 9 18 I ↔ R I \leftrightarrow R I ↔ R ( 9 + 18 = 27 9 + 18 = 27 9 + 18 = 27 )
  • J 10 17 J ↔ Q J \leftrightarrow Q J ↔ Q ( 10 + 17 = 27 10 + 17 = 27 10 + 17 = 27 )
  • K 11 16 K ↔ P K \leftrightarrow P K ↔ P ( 11 + 16 = 27 11 + 16 = 27 11 + 16 = 27 )
  • L 12 15 L ↔ O L \leftrightarrow O L ↔ O ( 12 + 15 = 27 12 + 15 = 27 12 + 15 = 27 )
  • M 13 14 M ↔ N M \leftrightarrow N M ↔ N ( 13 + 14 = 27 13 + 14 = 27 13 + 14 = 27 )
  • N 14 13 N ↔ M N \leftrightarrow M N ↔ M ( 14 + 13 = 27 14 + 13 = 27 14 + 13 = 27 )
  • O 15 12 O ↔ L O \leftrightarrow L O ↔ L ( 15 + 12 = 27 15 + 12 = 27 15 + 12 = 27 )
  • P 16 11 P ↔ K P \leftrightarrow K P ↔ K ( 16 + 11 = 27 16 + 11 = 27 16 + 11 = 27 )
  • Q 17 10 Q ↔ J Q \leftrightarrow J Q ↔ J ( 17 + 10 = 27 17 + 10 = 27 17 + 10 = 27 )
  • R 18 9 R ↔ I R \leftrightarrow I R ↔ I ( 18 + 9 = 27 18 + 9 = 27 18 + 9 = 27 )
  • S 19 8 S ↔ H S \leftrightarrow H S ↔ H ( 19 + 8 = 27 19 + 8 = 27 19 + 8 = 27 )
  • T 20 7 T ↔ G T \leftrightarrow G T ↔ G ( 20 + 7 = 27 20 + 7 = 27 20 + 7 = 27 )
  • U 21 6 U ↔ F U \leftrightarrow F U ↔ F ( 21 + 6 = 27 21 + 6 = 27 21 + 6 = 27 )
  • V 22 5 V ↔ E V \leftrightarrow E V ↔ E ( 22 + 5 = 27 22 + 5 = 27 22 + 5 = 27 )
  • W 23 4 W ↔ D W \leftrightarrow D W ↔ D ( 23 + 4 = 27 23 + 4 = 27 23 + 4 = 27 )
  • X 24 3 X ↔ C X \leftrightarrow C X ↔ C ( 24 + 3 = 27 24 + 3 = 27 24 + 3 = 27 )
  • Y 25 2 Y ↔ B Y \leftrightarrow B Y ↔ B ( 25 + 2 = 27 25 + 2 = 27 25 + 2 = 27 )
  • Z 26 1 Z ↔ A Z \leftrightarrow A Z ↔ A ( 26 + 1 = 27 26 + 1 = 27 26 + 1 = 27 )

Tip

The Rule of 27: Notice that for any letter, its forward index plus its reverse index always equals 27 . For example, H H H is 8th from the start and 19th from the end ( 8 + 19 = 27 8 + 19 = 27 8 + 19 = 27 ). If a question uses reverse pairings, subtracting the forward index from 27 instantly yields the symmetrical counterpart.

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 , [ ? ] C, F, I, L, O, [?] C , F , I , L , O , [ ?]
  • Numerical conversion: 3 , 6 , 9 , 12 , 15 3, 6, 9, 12, 15 3 , 6 , 9 , 12 , 15
  • Rule: + 3 +3 + 3 each time
  • Next value: 15 + 3 = 18 ⟹ R 15 + 3 = 18 \implies R 15 + 3 = 18 ⟹ R
  • 2. Accelerating and Decelerating Shifts

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

  • Example: B , C , E , H , L , [ ? ] B, C, E, H, L, [?] B , C , E , H , L , [ ?]
  • Numerical conversion: 2 , 3 , 5 , 8 , 12 2, 3, 5, 8, 12 2 , 3 , 5 , 8 , 12
  • Difference vector: + 1 , + 2 , + 3 , + 4 +1, +2, +3, +4 + 1 , + 2 , + 3 , + 4
  • Next shift: + 5 +5 + 5
  • Next value: 12 + 5 = 17 ⟹ Q 12 + 5 = 17 \implies Q 12 + 5 = 17 ⟹ 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 , [ ? ] D, G, F, I, H, K, [?] D , G , F , I , H , K , [ ?]
  • Numerical conversion: 4 , 7 , 6 , 9 , 8 , 11 4, 7, 6, 9, 8, 11 4 , 7 , 6 , 9 , 8 , 11
  • Difference vector: + 3 , − 1 , + 3 , − 1 , + 3 +3, -1, +3, -1, +3 + 3 , − 1 , + 3 , − 1 , + 3
  • Next shift: − 1 -1 − 1
  • Next value: 11 − 1 = 10 ⟹ J 11 - 1 = 10 \implies J 11 − 1 = 10 ⟹ 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 , [ ? ] A, Z, C, X, E, V, [?] A , Z , C , X , E , V , [ ?]

Odd positions ( 1 st , 3 rd , 5 th , 7 th 1^{\text{st}}, 3^{\text{rd}}, 5^{\text{th}}, 7^{\text{th}} 1 st , 3 rd , 5 th , 7 th ): A ( 1 ) → + 2 C ( 3 ) → + 2 E ( 5 ) → + 2 G ( 7 ) A(1) \xrightarrow{+2} C(3) \xrightarrow{+2} E(5) \xrightarrow{+2} G(7) A ( 1 ) + 2 ​ C ( 3 ) + 2 ​ E ( 5 ) + 2 ​ G ( 7 )

Even positions ( 2 nd , 4 th , 6 th 2^{\text{nd}}, 4^{\text{th}}, 6^{\text{th}} 2 nd , 4 th , 6 th ): Z ( 26 ) → − 2 X ( 24 ) → − 2 V ( 22 ) Z(26) \xrightarrow{-2} X(24) \xrightarrow{-2} V(22) Z ( 26 ) − 2 ​ X ( 24 ) − 2 ​ V ( 22 )

Missing term: The 7th position belongs to the odd series, so the answer is G G 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 +2, +3, +5, +7, +11 + 2 , + 3 , + 5 , + 7 , + 11
  • Square number shifts: + 1 , + 4 , + 9 , + 16 +1, +4, +9, +16 + 1 , + 4 , + 9 , + 16
  • Fibonacci shifts: + 1 , + 1 , + 2 , + 3 , + 5 , + 8 +1, +1, +2, +3, +5, +8 + 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., A Z , C X , E V , G T AZ, CX, EV, GT A Z , CX , E V , 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: D W , G T , J Q , M N , [ ? ] DW, GT, JQ, MN, [?] D W , GT , J Q , MN , [ ?]

Step-by-step Solution:

Track the first letters independently: D ( 4 ) → G ( 7 ) → J ( 10 ) → M ( 13 ) D(4) \to G(7) \to J(10) \to M(13) D ( 4 ) → G ( 7 ) → J ( 10 ) → M ( 13 )

  • Shift rule: + 3 , + 3 , + 3 +3, +3, +3 + 3 , + 3 , + 3
  • Next first letter: 13 + 3 = 16 ⟹ P 13 + 3 = 16 \implies P 13 + 3 = 16 ⟹ P

Track the second letters independently: W ( 23 ) → T ( 20 ) → Q ( 17 ) → N ( 14 ) W(23) \to T(20) \to Q(17) \to N(14) W ( 23 ) → T ( 20 ) → Q ( 17 ) → N ( 14 )

  • Shift rule: − 3 , − 3 , − 3 -3, -3, -3 − 3 , − 3 , − 3
  • Next second letter: 14 − 3 = 11 ⟹ K 14 - 3 = 11 \implies K 14 − 3 = 11 ⟹ K

Combine the letters: The next term is P K PK P K .

Verify reverse symmetry: D ( 4 ) + W ( 23 ) = 27 D(4) + W(23) = 27 D ( 4 ) + W ( 23 ) = 27 ; G ( 7 ) + T ( 20 ) = 27 G(7) + T(20) = 27 G ( 7 ) + T ( 20 ) = 27 ; J ( 10 ) + Q ( 17 ) = 27 J(10) + Q(17) = 27 J ( 10 ) + Q ( 17 ) = 27 ; M ( 13 ) + N ( 14 ) = 27 M(13) + N(14) = 27 M ( 13 ) + N ( 14 ) = 27 . For our answer, P ( 16 ) + K ( 11 ) = 27 P(16) + K(11) = 27 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: Y A C , W C E , U E G , S G I , [ ? ] YAC, WCE, UEG, SGI, [?] Y A C , W CE , U EG , SG I , [ ?]

Step-by-step Solution:

First letter stream: Y ( 25 ) → W ( 23 ) → U ( 21 ) → S ( 19 ) Y(25) \to W(23) \to U(21) \to S(19) Y ( 25 ) → W ( 23 ) → U ( 21 ) → S ( 19 )

Shift: − 2 -2 − 2 each step.

Next first letter: 19 − 2 = 17 ⟹ Q 19 - 2 = 17 \implies Q 19 − 2 = 17 ⟹ Q .

Second letter stream: A ( 1 ) → C ( 3 ) → E ( 5 ) → G ( 7 ) A(1) \to C(3) \to E(5) \to G(7) A ( 1 ) → C ( 3 ) → E ( 5 ) → G ( 7 )

Shift: + 2 +2 + 2 each step.

Next second letter: 7 + 2 = 9 ⟹ I 7 + 2 = 9 \implies I 7 + 2 = 9 ⟹ I .

Third letter stream: C ( 3 ) → E ( 5 ) → G ( 7 ) → I ( 9 ) C(3) \to E(5) \to G(7) \to I(9) C ( 3 ) → E ( 5 ) → G ( 7 ) → I ( 9 )

Shift: + 2 +2 + 2 each step.

Next third letter: 9 + 2 = 11 ⟹ K 9 + 2 = 11 \implies K 9 + 2 = 11 ⟹ K .

Combine the resulting letters: The missing triplet is Q I K QIK Q I K .

Reverse Alphabet Pairings & Symmetry Mnemonics

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

  • A – Z: A mazon / A to Z
  • B – Y: B y-e ( B ye)
  • C – X: C ru x / C hristmas ( X mas)
  • D – W: D oor W indow
  • E – V: EV ening / EV ery
  • F – U: FU ll / FU n
  • G – T: G reat / G rand T runk
  • H – S: H igh S chool
  • I – R: I ndian R ailway
  • J – Q: J ack and Q ueen
  • K – P: K ing P otter / K angaroos P lay
  • L – O: LO ve
  • M – N: M oo N / M a N

When a question pairs letters whose indices sum to 27 ( A ↔ Z A \leftrightarrow Z A ↔ Z , B ↔ Y B \leftrightarrow Y B ↔ 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: Group 1 : Group 2 : : Group 3 : [ ? ] \text{Group 1} : \text{Group 2} :: \text{Group 3} : [?] Group 1 : Group 2 :: Group 3 : [ ?]

  • Worked Example 3: Transformation Vector Deduction
  • Problem: B D F BDF B D F is to H J L HJL H J L as M O Q MOQ MOQ is to [ ? ] [?] [ ?]

Step-by-step Solution:

Determine the positional index for each letter in the first pair:

  • B ( 2 ) → H ( 8 ) ⟹ + 6 B(2) \to H(8) \implies +6 B ( 2 ) → H ( 8 ) ⟹ + 6
  • D ( 4 ) → J ( 10 ) ⟹ + 6 D(4) \to J(10) \implies +6 D ( 4 ) → J ( 10 ) ⟹ + 6
  • F ( 6 ) → L ( 12 ) ⟹ + 6 F(6) \to L(12) \implies +6 F ( 6 ) → L ( 12 ) ⟹ + 6
  • Express the transformation vector: V ⃗ = [ + 6 , + 6 , + 6 ] \vec{V} = [+6, +6, +6] V = [ + 6 , + 6 , + 6 ]

Apply the vector to the target group ( M O Q MOQ MOQ ):

  • First letter: M ( 13 ) + 6 = 19 ⟹ S M(13) + 6 = 19 \implies S M ( 13 ) + 6 = 19 ⟹ S
  • Second letter: O ( 15 ) + 6 = 21 ⟹ U O(15) + 6 = 21 \implies U O ( 15 ) + 6 = 21 ⟹ U
  • Third letter: Q ( 17 ) + 6 = 23 ⟹ W Q(17) + 6 = 23 \implies W Q ( 17 ) + 6 = 23 ⟹ W

Synthesize the answer: M O Q MOQ MOQ transforms into S U W SUW S U W .

Common Traps and Timing Techniques

Trap Type Description How to Avoid

The Counting Start Trap Counting the starting letter as step 1 instead of counting the interval/jump. Always count the hops between letters, not the letters themselves. If moving from C C C to F F F , count: D ( 1 ) , E ( 2 ) , F ( 3 ) ⟹ + 3 D(1), E(2), F(3) \implies +3 D ( 1 ) , E ( 2 ) , F ( 3 ) ⟹ + 3 , not C ( 1 ) , D ( 2 ) , E ( 3 ) , F ( 4 ) C(1), D(2), E(3), F(4) C ( 1 ) , D ( 2 ) , E ( 3 ) , F ( 4 ) .

The Z-to-A Gap Confusion Forgetting that A A A follows Z Z Z with no gap. Remember that Z = 26 Z = 26 Z = 26 and A = 27 A = 27 A = 27 when moving forward. Adding 2 to Y ( 25 ) Y(25) Y ( 25 ) lands on A ( 1 ) A(1) A ( 1 ) .

Distractor Similarity Trap Selecting an option that mirrors the start letters but alters the final letter (e.g., choosing S U X SUX S U X instead of S U W SUW S U W ). Always calculate and verify every letter position in the term before confirming your choice.

Visual Letter Confusion Misreading letters under time pressure (e.g., E E E for F F F , O O O for Q Q Q , I I I for L L L ). Write letters in clean, distinct block capitals on your scratch paper.