Study guide
2.3 Number, Letter, and Alphanumeric Series
Pakistan Army PMA Long Course Initial Test Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Course Overview, Registration & Selection Lifecycle
1.1 Course Eligibility, Educational Criteria & AS&RC Registration Process 1.2 The AS&RC Selection Day Lifecycle: Testing Order, Rules & Preliminary Milestones 1.3 Physical Efficiency Standards, Medical Screening & Initial Interview
2 Chapter 2: Verbal Intelligence: Word, Logical & Sequence Reasoning
2.1 Verbal Analogies and Word Classification 2.2 Synonyms, Antonyms and Sentence Logic 2.3 Number, Letter, and Alphanumeric Series
3 Chapter 3: Verbal Intelligence: Mathematical, Direction & Relational Logic
3.1 Coding-Decoding and Symbolic Substitution 3.2 Direction Sense, Speed-Distance-Time, and Clock Problems 3.3 Blood Relations, Family Trees, and Age Problems
4 Chapter 4: Non-Verbal Intelligence: Visual Patterns, Sequences & Spatial Reasoning
4.1 Figure and Pattern Series Completion 4.2 Odd-One-Out, Shape Classification, and Visual Analogies 4.3 Mirror Images, Water Reflections, and Figure Rotations 4.4 Embedded Figures, Paper Folding, and Spatial Matrix Completion
5 Chapter 5: Academic Test: English & Mathematics
5.1 English Grammar, Prepositions, Active/Passive Voice & Sentence Correction 5.2 English Vocabulary, Idiomatic Expressions, and Verbal Usage 5.3 Essential Mathematics: Arithmetic, Percentages, Ratios, and Profit & Loss 5.4 Algebra, Basic Geometry, and Quantitative Word Problems
6 Chapter 6: Academic Test: Pakistan Studies & Islamiat
6.1 Pakistan Movement (1857–1947), Two-Nation Theory & Historical Milestones 6.2 Constitutional Evolution, Geography, Borders, and Strategic Landmarks of Pakistan 6.3 Fundamental Pillars of Islam, Quranic Knowledge & Prophetic Era 6.4 Seerat-un-Nabi, Major Ghazwat, Khulfa-e-Rashideen & Islamic History
7 Chapter 7: Academic Test: General Knowledge & High-Yield Strategy
7.1 World Geography, Continents, Capitals, Currencies & Strategic Straits 7.2 International Organizations, Treaties, and Global Institutions 7.3 General Science Fundamentals & Military/Defense GK 7.4 AS&RC Computer-Based Testing Strategy, Pacing & Time Management
2.3 Number, Letter, and Alphanumeric Series
Key Takeaways Explain This Topic AI
Sequence completion assesses inductive reasoning and algorithmic pattern recognition, and is a recurring verbal-intelligence question type.
The primary diagnostic step for any numerical sequence is calculating first-order differences (Δ1); if Δ1 is not constant, compute the second-order differences (Δ2) to identify polynomial rules.
Alternating dual series interleave two independent sequences across odd and even positions and are readily diagnosed by oscillating values that rise and fall.
Alphabet series depend on numerical positional mapping (A=1 to Z=26), the landmark EJOTY anchor system, and reciprocal opposite pairs summing to 27.
Composite alphanumeric sequences must be decomposed into separate alphabetical and numerical tracks, solved independently, and recombined into the final term.
Last updated: October 2026
2.3 Number, Letter, and Alphanumeric Series
Core Principle: Every series is governed by a consistent rule of progression. Deconstructing a series into its elementary mathematical operations or separating multi-component terms into parallel tracks reveals the governing pattern rapidly.
In the AS&RC computerized testing battery, series completion problems evaluate a candidate's inductive reasoning, mathematical intuition, and working memory. These questions are a common verbal-reasoning form. Under any timed format, candidates should avoid unsystematic trial-and-error arithmetic. You must apply a structured diagnostic protocol to recognize the underlying series archetype immediately.
Taxonomy of Number Series Archetypes
Number series in verbal intelligence testing fall into six well-defined mathematical categories: ┌───────────────────────────────┐
- │ Number Series Classification │
- └───────────────┬───────────────┘
- │
- ┌─────────────────┬─────────────────┼─────────────────┬─────────────────┐
- ▼ ▼ ▼ ▼ ▼
- ┌─────────────┐ ┌─────────────┐ ┌─────────────┐ ┌─────────────┐ ┌─────────────┐
- │ Arithmetic │ │ Geometric │ │Second-Order │ │ Alternating │ │ Squares & │
- │ (Constant Δ)│ │ (Ratio r) │ │(Diff of Diff│ │ (Interleaved│ │ Cubes (n²,n³)│
- └─────────────┘ └─────────────┘ └─────────────┘ └─────────────┘ └─────────────┘
- 1. Arithmetic Difference Series
In an arithmetic series, each successive term is generated by adding or subtracting a constant or systematically changing value:
Constant Difference: T n = T n − 1 + d T_n = T_{n-1} + d T n = T n − 1 + d . For example: 7 , 13 , 19 , 25 , 31 , … 7, 13, 19, 25, 31, \dots 7 , 13 , 19 , 25 , 31 , … ( d = + 6 d = +6 d = + 6 ; next term is 31 + 6 = 37 31 + 6 = 37 31 + 6 = 37 ).
Progressively Increasing Difference: The increment itself forms an arithmetic progression. For example: 3 , 5 , 9 , 15 , 23 , … 3, 5, 9, 15, 23, \dots 3 , 5 , 9 , 15 , 23 , … Here, the successive differences are + 2 , + 4 , + 6 , + 8 +2, +4, +6, +8 + 2 , + 4 , + 6 , + 8 ; the next difference is + 10 +10 + 10 , giving 23 + 10 = 33 23 + 10 = 33 23 + 10 = 33 .
2. Geometric / Ratio Series
Terms change by a constant multiplier or divisor: T n = T n − 1 × r T_n = T_{n-1} \times r T n = T n − 1 × r or T n = T n − 1 ÷ r T_n = T_{n-1} \div r T n = T n − 1 ÷ r :
Direct Ratio: 3 , 6 , 12 , 24 , 48 , … 3, 6, 12, 24, 48, \dots 3 , 6 , 12 , 24 , 48 , … ( r = 2 r = 2 r = 2 ; next term is 48 × 2 = 96 48 \times 2 = 96 48 × 2 = 96 ).
Compound Operations: Multiplying by a constant and adding or subtracting a fixed value: T n = ( T n − 1 × 2 ) − 1 T_n = (T_{n-1} \times 2) - 1 T n = ( T n − 1 × 2 ) − 1 . For example: 3 , 5 , 9 , 17 , 33 , … 3, 5, 9, 17, 33, \dots 3 , 5 , 9 , 17 , 33 , … ( 3 × 2 − 1 = 5 3 \times 2 - 1 = 5 3 × 2 − 1 = 5 ; 5 × 2 − 1 = 9 5 \times 2 - 1 = 9 5 × 2 − 1 = 9 ; next is 33 × 2 − 1 = 65 33 \times 2 - 1 = 65 33 × 2 − 1 = 65 ).
3. Difference-of-Differences (Second-Order Sequences)
When the first differences ( Δ 1 \Delta_1 Δ 1 ) between terms are not constant, calculate the differences between those differences ( Δ 2 \Delta_2 Δ 2 ). If Δ 2 \Delta_2 Δ 2 is constant, the sequence is governed by a quadratic rule: Sequence: 2 5 10 17 26 37 Δ 1 (First Diff): + 3 + 5 + 7 + 9 + 11 Δ 2 (Second Diff): + 2 + 2 + 2 + 2 \begin{array}{lcccccccc}
- \text{Sequence:} & 2 & & 5 & & 10 & & 17 & & 26 & & 37 \\
- \Delta_1 \text{ (First Diff):} & & +3 & & +5 & & +7 & & +9 & & +11 & \\
- \Delta_2 \text{ (Second Diff):} & & & +2 & & +2 & & +2 & & +2 & &
\end{array} Sequence: Δ 1 (First Diff): Δ 2 (Second Diff): 2 + 3 5 + 2 + 5 10 + 2 + 7 17 + 2 + 9 26 + 2 + 11 37
Following the constant Δ 2 = + 2 \Delta_2 = +2 Δ 2 = + 2 , the next first difference must be 11 + 2 = 13 11 + 2 = 13 11 + 2 = 13 . The next term is 37 + 13 = 50 37 + 13 = 50 37 + 13 = 50 .
4. Alternating Dual Series (Interleaved Sequences)
An alternating series consists of two independent sequences woven together, with one sequence occupying odd-numbered positions (1st, 3rd, 5th, 7th) and the other occupying even-numbered positions (2nd, 4th, 6th, 8th). These are immediately recognizable because the numbers fluctuate up and down rather than increasing or decreasing monotonically. Terms: 4 , 18 , 8 , 14 , 12 , 10 , 16 , ? Track 1 (Odd): 4 → + 4 8 → + 4 12 → + 4 16 Track 2 (Even): 18 → − 4 14 → − 4 10 → − 4 6 \begin{array}{lcccccccc}
\text{Terms:} & \mathbf{4}, & 18, & \mathbf{8}, & 14, & \mathbf{12}, & 10, & \mathbf{16}, & ? \\
\text{Track 1 (Odd):} & \mathbf{4} & \xrightarrow{+4} & \mathbf{8} & \xrightarrow{+4} & \mathbf{12} & \xrightarrow{+4} & \mathbf{16} & \\
\text{Track 2 (Even):} & & 18 & \xrightarrow{-4} & 14 & \xrightarrow{-4} & 10 & \xrightarrow{-4} & \mathbf{6}
\end{array} Terms: Track 1 (Odd): Track 2 (Even): 4 , 4 18 , + 4 18 8 , 8 − 4 14 , + 4 14 12 , 12 − 4 10 , + 4 10 16 , 16 − 4 ? 6
The missing term is in the 8th position (an even index), so it continues Track 2: 10 − 4 = 6 10 - 4 = 6 10 − 4 = 6 .
5. Square and Cube Sequences
Candidates must memorize perfect squares up to 15 2 15^2 1 5 2 and cubes up to 10 3 10^3 1 0 3 for instant recall:
Squares ( n 2 n^2 n 2 ): 1 , 4 , 9 , 16 , 25 , 36 , 49 , 64 , 81 , 100 , 121 , 144 , 169 , 196 , 225 1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169, 196, 225 1 , 4 , 9 , 16 , 25 , 36 , 49 , 64 , 81 , 100 , 121 , 144 , 169 , 196 , 225 .
Cubes ( n 3 n^3 n 3 ): 1 , 8 , 27 , 64 , 125 , 216 , 343 , 512 , 729 , 1000 1, 8, 27, 64, 125, 216, 343, 512, 729, 1000 1 , 8 , 27 , 64 , 125 , 216 , 343 , 512 , 729 , 1000 .
Modified Powers: Often tests introduce a constant shift: n 2 − 1 n^2 - 1 n 2 − 1 ( 0 , 3 , 8 , 15 , 24 , 35 , 48 … 0, 3, 8, 15, 24, 35, 48\dots 0 , 3 , 8 , 15 , 24 , 35 , 48 … ), n 2 + 1 n^2 + 1 n 2 + 1 ( 2 , 5 , 10 , 17 , 26 , 37 , 50 … 2, 5, 10, 17, 26, 37, 50\dots 2 , 5 , 10 , 17 , 26 , 37 , 50 … ), or n 3 − 1 n^3 - 1 n 3 − 1 ( 0 , 7 , 26 , 63 , 124 , 215 … 0, 7, 26, 63, 124, 215\dots 0 , 7 , 26 , 63 , 124 , 215 … ).
6. Fibonacci and Additive Progressions
In an additive series, each term is the sum of the preceding terms:
Standard Fibonacci: T n = T n − 1 + T n − 2 T_n = T_{n-1} + T_{n-2} T n = T n − 1 + T n − 2 . Sequence: 1 , 1 , 2 , 3 , 5 , 8 , 13 , 21 , 34 , … 1, 1, 2, 3, 5, 8, 13, 21, 34, \dots 1 , 1 , 2 , 3 , 5 , 8 , 13 , 21 , 34 , …
Three-Term Additive (Tribonacci): T n = T n − 1 + T n − 2 + T n − 3 T_n = T_{n-1} + T_{n-2} + T_{n-3} T n = T n − 1 + T n − 2 + T n − 3 . For example: 1 , 2 , 3 , 6 , 11 , 20 , 37 , … 1, 2, 3, 6, 11, 20, 37, \dots 1 , 2 , 3 , 6 , 11 , 20 , 37 , … ( 1 + 2 + 3 = 6 1+2+3=6 1 + 2 + 3 = 6 ; 2 + 3 + 6 = 11 2+3+6=11 2 + 3 + 6 = 11 ; 3 + 6 + 11 = 20 3+6+11=20 3 + 6 + 11 = 20 ; 6 + 11 + 20 = 37 6+11+20=37 6 + 11 + 20 = 37 ; next is 11 + 20 + 37 = 68 11+20+37 = 68 11 + 20 + 37 = 68 ).
Alphabetical Position Mapping & Letter Series
Letter series problems transform alphabetical sequences into numerical coordinate tracks. Candidates must convert letters to numbers instantly using positional mapping.
1. Forward Alphabetical Coordinates
Assign each letter its forward chronological value from 1 1 1 to 26 26 26 : A=1 B=2 C=3 D=4 E=5 F=6 G=7 H=8 I=9 J=10 K=11 L=12 M=13
N=14 O=15 P=16 Q=17 R=18 S=19 T=20 U=21 V=22 W=23 X=24 Y=25 Z=26
The EJOTY Anchor System: Memorize the landmark multiples of 5 to navigate the alphabet rapidly without reciting it from A: 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
To find R R R : T = 20 T = 20 T = 20 , so R = 20 − 2 = 18 R = 20 - 2 = 18 R = 20 − 2 = 18 .
To find L L L : J = 10 J = 10 J = 10 , so L = 10 + 2 = 12 L = 10 + 2 = 12 L = 10 + 2 = 12 .
2. Reverse Alphabetical Coordinates (The Rule of 27)
To find a letter's rank counting backward from Z Z Z ( Z = 1 , Y = 2 , … , A = 26 Z=1, Y=2, \dots, A=26 Z = 1 , Y = 2 , … , A = 26 ), subtract its forward rank from 27 27 27 : Reverse Rank = 27 − Forward Rank \text{Reverse Rank} = 27 - \text{Forward Rank} Reverse Rank = 27 − Forward Rank
Example: Forward rank of H = 8 H = 8 H = 8 . Reverse rank = 27 − 8 = 19 = 27 - 8 = 19 = 27 − 8 = 19 .
Example: Forward rank of V = 22 V = 22 V = 22 . Reverse rank = 27 − 22 = 5 = 27 - 22 = 5 = 27 − 22 = 5 .
3. Reciprocal Opposite Letter Pairs
Opposite pairs are letters that occupy matching positions from opposite ends of the alphabet. Their forward positional values always sum to 27 :
- Pair Forward Positions Sum Memory Mnemonic
- A – Z 1 + 26 1 + 26 1 + 26 27 AZ (A to Z)
- B – Y 2 + 25 2 + 25 2 + 25 27 BY (Good-bye)
- C – X 3 + 24 3 + 24 3 + 24 27 CX (Crux)
- D – W 4 + 23 4 + 23 4 + 23 27 DW (Dew / Down-wind)
- E – V 5 + 22 5 + 22 5 + 22 27 EV (Even)
- F – U 6 + 21 6 + 21 6 + 21 27 FU (Full)
- G – T 7 + 20 7 + 20 7 + 20 27 GT (GT Road)
- H – S 8 + 19 8 + 19 8 + 19 27 HS (High School)
- I – R 9 + 18 9 + 18 9 + 18 27 IR (Indian Railway)
- J – Q 10 + 17 10 + 17 10 + 17 27 JQ (Jungle Queen)
- K – P 11 + 16 11 + 16 11 + 16 27 KP (Khyber Pass / KPK)
- L – O 12 + 15 12 + 15 12 + 15 27 LO (Light Out)
- M – N 13 + 14 13 + 14 13 + 14 27 MN (Man)
- Composite Alphanumeric Series
Alphanumeric series combine letters and numbers within each term. To solve these reliably under time constraints, apply Dual-Track Separation : never treat the letter and number as a unified symbol. Split the series into two completely independent tracks, solve each rule separately, and recombine them.
Worked Example: Dual-Track Separation
Prompt: *Find the missing term in the sequence: B 4 , D 8 , G 16 , K 32 , ? B4, D8, G16, K32, ? B 4 , D 8 , G 16 , K 32 , ?
Track 1 (Letter Progression): Extract letters: B , D , G , K , ? B, D, G, K, ? B , D , G , K , ?
Map to numbers: B = 2 , D = 4 , G = 7 , K = 11 B = 2, D = 4, G = 7, K = 11 B = 2 , D = 4 , G = 7 , K = 11 .
Calculate differences: 2 → + 2 4 → + 3 7 → + 4 11 2 \xrightarrow{+2} 4 \xrightarrow{+3} 7 \xrightarrow{+4} 11 2 + 2 4 + 3 7 + 4 11 .
Next difference must be + 5 +5 + 5 : 11 + 5 = 16 11 + 5 = 16 11 + 5 = 16 .
Coordinate 16 16 16 corresponds to the letter P .
Track 2 (Number Progression): Extract numbers: 4 , 8 , 16 , 32 , ? 4, 8, 16, 32, ? 4 , 8 , 16 , 32 , ?
This is a geometric progression doubling each time ( × 2 \times 2 × 2 ):
4 × 2 = 8 4 \times 2 = 8 4 × 2 = 8 , 8 × 2 = 16 8 \times 2 = 16 8 × 2 = 16 , 16 × 2 = 32 16 \times 2 = 32 16 × 2 = 32 .
Next number: 32 × 2 = 64 32 \times 2 = \mathbf{64} 32 × 2 = 64 .
Recombine the Tracks: Merging the letter result ( P P P ) and number result ( 64 64 64 ) yields P64 .
Systematic 3-Step Sequence Diagnostic Protocol
When a series appears on your screen, execute this diagnostic checklist within the first 5 seconds:
Step 1: Check Direction and Uniformity
Does the series move in one direction (monotonically increasing or decreasing)? If yes, it is a single-track arithmetic, geometric, or power sequence.
Does it fluctuate (rise, fall, rise, fall)? If yes, immediately split into odd and even positions to test for an interleaved alternating dual series.
Step 2: Calculate First-Order Differences ( Δ 1 \Delta_1 Δ 1 )
Write or mentally compute differences between the first three terms.
If differences are constant, you have an arithmetic series ( + d +d + d ).
If differences grow by a constant addition, you have a second-order series ( Δ 2 \Delta_2 Δ 2 ).
If terms grow rapidly by doubling or tripling, test multiplication ratios ( × r \times r × r ).
Step 3: Test Benchmark Powers & Coordinates
If the numbers are close to 25 , 36 , 49 , 64 , 81 25, 36, 49, 64, 81 25 , 36 , 49 , 64 , 81 , test n 2 ± c n^2 \pm c n 2 ± c .
If letters are involved, convert instantly to numerical coordinates using EJOTY or test for opposite pairs summing to 27.