Study guide
3.1 Letter Codes & Cryptographic Shifts
Edutest Selective Entry & Scholarship Exam Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Exam Structure, Results & Pacing Strategy
1.1 Exam Structure, Format & Test Battery 1.2 Results, Year-Level Norms & How Schools Select 1.3 Speed Tactics, Time Budgeting & Zero-Penalty Guessing
2 Chapter 2: Verbal Reasoning: Analogies, Classification & Vocabulary
2.1 Word Analogies & Semantic Relationships 2.2 Verbal Classification & Odd-One-Out 2.3 Advanced Vocabulary, Synonyms & Antonyms
3 Chapter 3: Verbal Reasoning: Codes, Sequences & Logical Deduction
3.1 Letter Codes & Cryptographic Shifts 3.2 Word Chains, Anagrams & Hidden Words 3.3 Verbal Deductive Logic & Syllogisms
4 Chapter 4: Numerical Reasoning: Sequences & Number Patterns
4.1 Arithmetic, Geometric & Two-Tier Differences 4.2 Alternating, Interleaved & Fibonacci Sequences 4.3 Square, Cube & Figurate Number Sequences
5 Chapter 5: Numerical Reasoning: Grids, Diagrams & Math Logic
5.1 Number Matrices & Grid Patterns 5.2 Geometric Shape Puzzles & Relational Diagrams 5.3 Cryptarithms & Quantitative Word Logic
6 Chapter 6: Reading Comprehension: Fiction & Literary Analysis
6.1 Narrative Structure, Plot Devices & Conflict 6.2 Figurative Language, Imagery & Tone 6.3 Characterization, Inferencing & Subtext
7 Chapter 7: Reading Comprehension: Non-Fiction, Poetry, Argument & Sentence Skills
7.1 Informational Text Structures & Main Idea 7.2 Poetry Analysis: Form, Rhyme, Rhythm & Meaning 7.3 Persuasive Techniques, Rhetoric & Author Bias 7.4 Sentence Correction, Sentence Completion & Punctuation
8 Chapter 8: Mathematics: Arithmetic, Fractions, Decimals & Percentages
8.1 Mental Arithmetic, Order of Operations & Number Properties 8.2 Fractions, Decimals & Mixed Operations 8.3 Percentages, Percentage Change & Financial Problems
9 Chapter 9: Mathematics: Rates, Ratios, Probability & Data
9.1 Ratios, Rates & Proportional Reasoning 9.2 Speed, Distance, Time & Combined Work 9.3 Probability, Counting Principles & Permutations 9.4 Data Interpretation, Dual-Axis Charts & Statistics
10 Chapter 10: Mathematics: Measurement, Geometry & Algebra
10.1 Perimeter, Area & Composite 2D Figures 10.2 Volume, Surface Area & 3D Spatial Visualization 10.3 Angles, Geometric Theorems, Polygons & Transformations 10.4 Algebraic Expressions, Linear Equations & Word Problems
11 Chapter 11: Written Expression: Narrative & Creative Writing
11.1 Narrative Architecture & Deconstructing Prompts 11.2 Sensory Immersion & Show-Don't-Tell Techniques 11.3 Mechanics, Punctuation Variety & Under-the-Gun Polish
12 Chapter 12: Written Expression: Persuasive & Expository Writing
12.1 Persuasive Prompt Deconstruction & Thesis Formation 12.2 High-Scoring Body Paragraphs: The PEEL/TEEL Framework 12.3 Expository Clarity, Rhetorical Flourish & Clincher Closures
3.1 Letter Codes & Cryptographic Shifts
Key Takeaways Explain This Topic AI
Edutest Verbal Reasoning cryptographic questions require rapid identification of alphabetical indices, modular arithmetic and directional shifts at a pace of roughly 30 to 45 seconds per item.
Committing the forward positions (A=1 to Z=26), the 'EJOTY' benchmark multiples of 5, and the Rule of 27 for complement mirror pairs eliminates the need to count on fingers.
Progressive and interleaved ciphers alternate rules between successive letters or odd-and-even positions; identifying the pattern in the first two letters is sufficient to eliminate most distractors.
Word-code mapping problems should be solved by frequency analysis and positional uniqueness rather than full cryptographic translation.
Memorising the split-alphabet matrix (A–M over Z–N) gives an instant mental lookup for shift distances and complement pairs, because separate working out paper is not permitted.
Last updated: October 2026
3.1 Letter Codes & Cryptographic Shifts
At a Glance: Cryptographic shift questions assess your working memory, mental agility, and pattern recognition by encoding words through systematic alphabetical transformations. Under Edutest's intense 30-second pacing, calculating letter positions by finger-counting guarantees failure. Mastering numerical mapping ( A = 1 A=1 A = 1 to Z = 26 Z=26 Z = 26 ), the Rule of 27 for complement pairs, and letter-frequency deduction allows you to decrypt codes in seconds.
The Cryptographic Landscape on the Edutest Paper
Edutest's Verbal Reasoning test lasts 30 minutes, and Edutest states that actual tests contain between 40 and 60 questions, so the average pace is 30 to 45 seconds per item. Edutest does not publish how many items use each format, but letter codes are a common way scholarship tests assess word relationships and deduction. Unlike standard vocabulary items that test semantic knowledge, cryptography evaluates fluid symbolic reasoning: your capacity to recognise mathematical, positional, and directional transformations applied to language.
Code items in reasoning tests commonly use five typologies:
Constant Caesar Ciphers: Uniform forward or backward positional shifts across all letters in a word.
Progressive Shift Ciphers: Step sizes that systematically increase or decrease across successive letter positions (e.g. + 1 , + 2 , + 3 , + 4 +1, +2, +3, +4 + 1 , + 2 , + 3 , + 4 ).
Interleaved Dual-Rule Ciphers: Odd-positioned letters follow one transformation rule, while even-positioned letters follow a separate, independent rule.
Complement / Reverse-Alphabet Ciphers: Letters are paired with their symmetrical mirror counterparts from the opposite end of the alphabet.
Group Word-Code Mapping: A set of four plain English words must be mapped to four letter- or digit-based codes through positional frequency deduction without complete translation.
To solve these problems in under 30 seconds, you must replace finger-counting with structured mental anchors.
Alphabetical Positioning & Numerical Mapping
Every English letter corresponds to a unique ordinal position from 1 to 26. Fluency in this forward index is non-negotiable.
The EJOTY Benchmark Anchor System
Memorising all 26 positions cold can feel daunting under timed stress. Instead, master the EJOTY mnemonic , which anchors every fifth letter in the alphabet:
E = 5 , J = 10 , O = 15 , T = 20 , Y = 25 \mathbf{E}=5, \quad \mathbf{J}=10, \quad \mathbf{O}=15, \quad \mathbf{T}=20, \quad \mathbf{Y}=25 E = 5 , J = 10 , O = 15 , T = 20 , Y = 25
Whenever you encounter any letter, locate its nearest EJOTY benchmark and step forward or backward by one or two positions:
To index G : Benchmarked to E ( 5 ) → E + 2 = 7 E(5) \rightarrow E + 2 = \mathbf{7} E ( 5 ) → E + 2 = 7 .
To index M : Benchmarked to O ( 15 ) → O − 2 = 13 O(15) \rightarrow O - 2 = \mathbf{13} O ( 15 ) → O − 2 = 13 (or J ( 10 ) + 3 = 13 J(10) + 3 = 13 J ( 10 ) + 3 = 13 ).
To index S : Benchmarked to T ( 20 ) → T − 1 = 19 T(20) \rightarrow T - 1 = \mathbf{19} T ( 20 ) → T − 1 = 19 .
To index W : Benchmarked to Y ( 25 ) → Y − 2 = 23 Y(25) \rightarrow Y - 2 = \mathbf{23} Y ( 25 ) → Y − 2 = 23 (or T ( 20 ) + 3 = 23 T(20) + 3 = 23 T ( 20 ) + 3 = 23 ).
Reverse Indexing and the Rule of 27
In reverse indexing, the alphabet runs backward: Z = 1 , Y = 2 , … , A = 26 Z=1, Y=2, \dots, A=26 Z = 1 , Y = 2 , … , A = 26 . Reverse ciphers and mirror-pair substitutions frequently appear in selective scholarship batteries.
Rather than memorising a second set of 26 numbers, apply the Rule of 27 :
Forward Position + Reverse Position = 27 \text{Forward Position} + \text{Reverse Position} = 27 Forward Position + Reverse Position = 27 Reverse Position = 27 − Forward Position \text{Reverse Position} = 27 - \text{Forward Position} Reverse Position = 27 − Forward Position
If a question asks for the reverse index of H ( H = 8 H = 8 H = 8 ), compute 27 − 8 = 19 27 - 8 = \mathbf{19} 27 − 8 = 19 .
Complement Pairs (Mirror Substitution)
Complement pairs occur when letters equidistant from the start and end of the alphabet substitute for one another: the 1st letter ( A A A ) pairs with the 26th letter ( Z Z Z ), the 2nd ( B B B ) with the 25th ( Y Y Y ), and the 13th ( M M M ) with the 14th ( N N N ).
Because the sum of their forward indices is always 27 , finding any mirror complement is immediate: find the letter whose position equals 27 − target position 27 - \text{target position} 27 − target position .
- Letter Forward Index Reverse Index Complement Pair Memory Peg
- A 1 26 Z A to Z
- B 2 25 Y B o y
- C 3 24 X C ruci x / C omi x
- D 4 23 W D oor W indow
- E 5 22 V EV ening / EV olution
- F 6 21 U FU ll / FU nky
- G 7 20 T G reat T ower / GT Racing
- H 8 19 S H igh S chool
- I 9 18 R I ron R oad / IR
- J 10 17 Q J ack & Q ueen
- K 11 16 P K ing P eter
- L 12 15 O LO ve
- M 13 14 N M orning & N oon
- Constant and Progressive Shift Rules (Caesar Ciphers)
- Constant Shifts and Circular Wrapping
A constant shift applies a fixed numerical offset ( + k +k + k or − k -k − k ) to every letter. When an addition exceeds 26 or a subtraction drops below 1, the alphabet wraps around circularly using modular arithmetic:
Moving forward past Z: If you add + 3 +3 + 3 to Y ( 25 ) Y(25) Y ( 25 ) , calculate 25 + 3 = 28 25 + 3 = 28 25 + 3 = 28 . Wrap by subtracting 26: 28 − 26 = 2 28 - 26 = \mathbf{2} 28 − 26 = 2 , giving B .
Moving backward past A: If you subtract − 3 -3 − 3 from B ( 2 ) B(2) B ( 2 ) , calculate 2 − 3 = − 1 2 - 3 = -1 2 − 3 = − 1 . Wrap by adding 26: − 1 + 26 = 25 -1 + 26 = \mathbf{25} − 1 + 26 = 25 , giving Y .
Progressive Shifts
In a progressive cipher , the shift value increments or decrements with each consecutive character position. For example, the first letter shifts by + 1 +1 + 1 , the second by + 2 +2 + 2 , the third by + 3 +3 + 3 , and so forth.
Worked Example 1: Progressive Cipher
Problem: In a proprietary code, the word CRANE is encrypted as DTDRJ . Following the identical rule, how is the word SWORD encrypted?
Step 1: Determine the transformation vector. Compare the positions of CRANE and DTDRJ :
- C ( 3 ) → D ( 4 ) C(3) \rightarrow D(4) C ( 3 ) → D ( 4 ) : Shift is + 1 +1 + 1
- R ( 18 ) → T ( 20 ) R(18) \rightarrow T(20) R ( 18 ) → T ( 20 ) : Shift is + 2 +2 + 2
- A ( 1 ) → D ( 4 ) A(1) \rightarrow D(4) A ( 1 ) → D ( 4 ) : Shift is + 3 +3 + 3
- N ( 14 ) → R ( 18 ) N(14) \rightarrow R(18) N ( 14 ) → R ( 18 ) : Shift is + 4 +4 + 4
- E ( 5 ) → J ( 10 ) E(5) \rightarrow J(10) E ( 5 ) → J ( 10 ) : Shift is + 5 +5 + 5
The pattern is an arithmetic progression of shifts: [ + 1 , + 2 , + 3 , + 4 , + 5 ] [+1, +2, +3, +4, +5] [ + 1 , + 2 , + 3 , + 4 , + 5 ] .
Step 2: Apply the transformation to SWORD .
- Letter 1: S ( 19 ) + 1 = 20 → T S(19) + 1 = 20 \rightarrow \mathbf{T} S ( 19 ) + 1 = 20 → T
- Letter 2: W ( 23 ) + 2 = 25 → Y W(23) + 2 = 25 \rightarrow \mathbf{Y} W ( 23 ) + 2 = 25 → Y
- Letter 3: O ( 15 ) + 3 = 18 → R O(15) + 3 = 18 \rightarrow \mathbf{R} O ( 15 ) + 3 = 18 → R
- Letter 4: R ( 18 ) + 4 = 22 → V R(18) + 4 = 22 \rightarrow \mathbf{V} R ( 18 ) + 4 = 22 → V
- Letter 5: D ( 4 ) + 5 = 9 → I D(4) + 5 = 9 \rightarrow \mathbf{I} D ( 4 ) + 5 = 9 → I
The encoded word is TYRVI .
Interleaved Letter Codes
When a sequence does not yield a consistent progression from one character to the next, check for interleaved rules . In this structure, odd-numbered positions ( P 1 , P 3 , P 5 P_1, P_3, P_5 P 1 , P 3 , P 5 ) operate under Rule A, while even-numbered positions ( P 2 , P 4 , P 6 P_2, P_4, P_6 P 2 , P 4 , P 6 ) operate under Rule B.
Worked Example 2: Interleaved Sequence
Problem: If FALCON is encoded as IYOARL , what is the code for SILVER ?
Step 1: Separate odd and even character streams. For FALCON → \rightarrow → IYOARL :
Odd positions ( 1 , 3 , 5 1, 3, 5 1 , 3 , 5 ):
- P 1 : F ( 6 ) → I ( 9 ) P_1: F(6) \rightarrow I(9) P 1 : F ( 6 ) → I ( 9 ) : + 3 +3 + 3
- P 3 : L ( 12 ) → O ( 15 ) P_3: L(12) \rightarrow O(15) P 3 : L ( 12 ) → O ( 15 ) : + 3 +3 + 3
- P 5 : O ( 15 ) → R ( 18 ) P_5: O(15) \rightarrow R(18) P 5 : O ( 15 ) → R ( 18 ) : + 3 +3 + 3
Rule A (Odd positions) = + 3 +3 + 3 .
Even positions ( 2 , 4 , 6 2, 4, 6 2 , 4 , 6 ):
P 2 : A ( 1 ) → Y ( 25 ) P_2: A(1) \rightarrow Y(25) P 2 : A ( 1 ) → Y ( 25 ) : − 2 -2 − 2 (circular wrap: 1 − 2 = − 1 ; − 1 + 26 = 25 1 - 2 = -1; -1 + 26 = 25 1 − 2 = − 1 ; − 1 + 26 = 25 )
- P 4 : C ( 3 ) → A ( 1 ) P_4: C(3) \rightarrow A(1) P 4 : C ( 3 ) → A ( 1 ) : − 2 -2 − 2
- P 6 : N ( 14 ) → L ( 12 ) P_6: N(14) \rightarrow L(12) P 6 : N ( 14 ) → L ( 12 ) : − 2 -2 − 2
Rule B (Even positions) = − 2 -2 − 2 .
Step 2: Apply the rules to SILVER .
- P 1 P_1 P 1 (Odd): S ( 19 ) + 3 = 22 → V S(19) + 3 = 22 \rightarrow \mathbf{V} S ( 19 ) + 3 = 22 → V
- P 2 P_2 P 2 (Even): I ( 9 ) − 2 = 7 → G I(9) - 2 = 7 \rightarrow \mathbf{G} I ( 9 ) − 2 = 7 → G
- P 3 P_3 P 3 (Odd): L ( 12 ) + 3 = 15 → O L(12) + 3 = 15 \rightarrow \mathbf{O} L ( 12 ) + 3 = 15 → O
- P 4 P_4 P 4 (Even): V ( 22 ) − 2 = 20 → T V(22) - 2 = 20 \rightarrow \mathbf{T} V ( 22 ) − 2 = 20 → T
- P 5 P_5 P 5 (Odd): E ( 5 ) + 3 = 8 → H E(5) + 3 = 8 \rightarrow \mathbf{H} E ( 5 ) + 3 = 8 → H
- P 6 P_6 P 6 (Even): R ( 18 ) − 2 = 16 → P R(18) - 2 = 16 \rightarrow \mathbf{P} R ( 18 ) − 2 = 16 → P
Interleaving the transformed characters yields VGOTHP .
Word-Code Mapping & Positional Deduction
A common reasoning-test format presents a list of four or five plain English words alongside four or five scrambled digit- or letter-based codes. Candidates are instructed to determine which code represents a specific target word.
Warning
The Rote Decoding Trap: Never attempt to decipher every single letter from scratch. Performing full translation consumes 70–90 seconds. Instead, use positional frequency analysis to crack the code in under 15 seconds.
The 3-Step Positional Frequency Technique
Scan Initial Characters: Count how many times each initial letter appears across the words, and compare this with the starting characters of the codes.
Scan Terminal Characters: Identify letters that appear only once in the final position or letters that repeat.
Isolate Unique Signatures: Match the unique positional profile of the target word directly to the codes.
Worked Example 3: Word-Code Matching
Problem: Four English words are paired with four numerical codes in random order:
- Words: COAT , TAIL , TOAD , LATE
- Codes: 4158 , 8562 , 8153 , 2587
Which code represents the word COAT ?
Step 1: Check initial letters versus initial digits.
Words start with: C (1 word: COAT ), T (2 words: TAIL , TOAD ), L (1 word: LATE ).
Codes start with: 4 (1 code: 4158 ), 8 (2 codes: 8562 , 8153 ), 2 (1 code: 2587 ).
Deduction: Because two words begin with T and two codes begin with 8 , the letter T must be represented by the digit 8 ( T = 8 T = 8 T = 8 ).
Step 2: Check terminal letters.
The target word is COAT . Its terminal letter is T .
Since we established that T = 8 T = 8 T = 8 , the code for COAT must end with the digit 8 .
Examining the final digits of the four codes:
- 4158 ends in 8
- 8562 ends in 2
- 8153 ends in 3
- 2587 ends in 7
Only a single code ends in 8: 4158 .
Without solving for C, O, A, I, L, D or E, the answer is proven in seconds. (As a check, the full key is C = 4, O = 1, A = 5, T = 8, I = 6, L = 2, D = 3 and E = 7, giving TAIL = 8562, TOAD = 8153 and LATE = 2587.)
Memory Strategy: The Split-Alphabet Matrix
Edutest does not permit separate working out paper, so the best approach is to memorise this split-alphabet matrix until you can picture it instantly. If your supervisor allows writing in the question booklet, you can also jot it in a margin: 1 2 3 4 5 6 7 8 9 10 11 12 13
- A B C D E F G H I J K L M
- --------------------------------------
- Z Y X W V U T S R Q P O N
- 26 25 24 23 22 21 20 19 18 17 16 15 14
This single diagram delivers three massive advantages:
Instant Indices: Read the forward position of any letter instantly without counting.
Instant Reverse Indices: Read reverse numbers directly from the bottom row.
Instant Complement Pairs: Vertical columns immediately display mirror partners (e.g. A ↔ Z , G ↔ T , M ↔ N A \leftrightarrow Z, G \leftrightarrow T, M \leftrightarrow N A ↔ Z , G ↔ T , M ↔ N ).