6.3 Numerical Reasoning: Arithmetic, Geometric, and Multi-Tier Sequences

Key Takeaways

  • The 5-question Numerical Reasoning module tests rapid pattern recognition across 5 structural tiers: arithmetic differences, second-order differences, geometric progressions, interleaved dual sequences, and composite power/recursive series.

  • Second-order difference sequences (where Δ2\Delta^2 is constant) represent quadratic functions xn=an2+bn+cx_n = an^2 + bn + c and can be verified within 15 seconds using a two-tier difference table.

  • Interleaved sequences weave two separate mathematical series into alternating odd and even positions, typically signaled by oscillating values or abrupt reversals in magnitude.

  • Composite operational sequences apply coupled transformations (xn+1=axn+bx_{n+1} = a x_n + b) or progressing arithmetic increments to geometric multipliers.

  • Memorizing benchmark numerical constants—including squares up to 25225^2, cubes up to 10310^3, powers of 2, and prime numbers—is essential for instant pattern recognition under examination time constraints.

Last updated: October 2026

6.3 Numerical Reasoning: Arithmetic, Geometric, and Multi-Tier Sequences

The Numerical Reasoning module of the Aptitude Test consists of 5 multiple-choice questions designed to assess numerical fluency, inductive logic, and rapid quantitative pattern extraction. Candidates are presented with a series of numbers that follow a rigorous, unstated mathematical rule and must determine the missing value (or values), typically denoted by a question mark (?), brackets, or alphabetical placeholders (X,YX, Y).

The CSB's directions say each question is a sequence of numbers with one or two numbers missing. Its sample, 2, 6, 10, ?, 18, 22, ?, shows that a gap can sit inside the sequence as well as at the end, and the five options give the two missing numbers as a pair (here 14 and 26, from a constant step of +4). A permitted calculator may be used in the Aptitude Test, but these items reward pattern spotting more than calculation.

Given the tight time constraint of 45 minutes for 35 total questions, candidates must resolve each Numerical Reasoning problem in approximately 60 to 75 seconds. Relying on disorganized trial-and-error arithmetic under exam conditions leads to cognitive fatigue and time overruns. To consistently crack sequence problems rapidly, candidates must deploy a Systematic 5-Tier Pattern Recognition Framework that tests hypotheses in order of structural probability.


The Systematic 5-Tier Pattern Recognition Framework

Most sequences you will meet can be classified into one of five structural tiers. When analyzing an unfamiliar series, systematically test through these tiers from simplest to most complex.

Tier 1: Constant First-Order Arithmetic Differences (Δ1=constant\Delta^1 = \text{constant})

In a Tier 1 sequence, each term is generated by adding or subtracting a constant difference dd from the preceding term:

xn+1=xn+d  ⟹  xn=x1+(n−1)dx_{n+1} = x_n + d \implies x_n = x_1 + (n - 1)d

  • Diagnostic Indicator: The numbers increase or decrease at a modest, perfectly uniform rate.
  • Representative Example: 7,12,17,22,27,…7, 12, 17, 22, 27, \dots (d=+5d = +5).

Tier 2: Second-Order Differences (Δ2=constant\Delta^2 = \text{constant} / Quadratic Sequences)

When the first-order differences between consecutive terms are not constant, but themselves form an arithmetic sequence, the series is governed by a constant second-order difference (Δ2\Delta^2):

Δk1=xk+1−xk,Δ2=Δk+11−Δk1=constant\Delta^1_k = x_{k+1} - x_k, \quad \Delta^2 = \Delta^1_{k+1} - \Delta^1_k = \text{constant}

Mathematically, any sequence with a constant second difference is a quadratic function of its position index nn:

xn=an2+bn+c,whereΔ2=2ax_n = an^2 + bn + c, \quad \text{where} \quad \Delta^2 = 2a

  • Diagnostic Indicator: The step difference grows or shrinks linearly (e.g., +3,+5,+7,+9+3, +5, +7, +9).
  • Representative Example: 3,6,11,18,27,…3, 6, 11, 18, 27, \dots (First differences: +3,+5,+7,+9+3, +5, +7, +9; Second difference: +2+2).

Tier 3: Geometric Progressions and Ratio Progressions

In a Tier 3 sequence, terms grow or shrink multiplicatively rather than additively:

  • Constant Ratio: xn+1=r⋅xnx_{n+1} = r \cdot x_n (e.g., 3,6,12,24,48,…3, 6, 12, 24, 48, \dots where r=2r = 2). Note that rr can be fractional (e.g., ×12\times \frac{1}{2}) or negative (e.g., ×(−3)\times (-3), which produces alternating signs +4,−12,+36,−108+4, -12, +36, -108).
  • Progressing Multipliers: The multiplier itself increments by a constant step (e.g., ×1,×2,×3,×4\times 1, \times 2, \times 3, \times 4 or ×2,×4,×8\times 2, \times 4, \times 8).
    • Example: 2,2,4,12,48,240,…2, 2, 4, 12, 48, 240, \dots (Multipliers: ×1,×2,×3,×4,×5\times 1, \times 2, \times 3, \times 4, \times 5).

Tier 4: Alternating and Interleaved Dual Sequences

When a sequence fluctuates erratically—rising, falling, and rising again—or when first-order differences show no coherent pattern, it almost invariably represents two independent sequences woven together:

  • Sub-sequence A: Occupies the odd-indexed positions (1st,3rd,5th,7th,…1^{\text{st}}, 3^{\text{rd}}, 5^{\text{th}}, 7^{\text{th}}, \dots).

  • Sub-sequence B: Occupies the even-indexed positions (2nd,4th,6th,8th,…2^{\text{nd}}, 4^{\text{th}}, 6^{\text{th}}, 8^{\text{th}}, \dots).

  • Diagnostic Indicator: The sequence possesses an unusually large number of terms (7 to 10 terms) or presents two missing numbers (X,YX, Y). The values oscillate or contain two separate monotonic trends.

  • Representative Example: 4,25,7,20,10,15,13,10,…4, 25, 7, 20, 10, 15, 13, 10, \dots

    • Odd terms: 4,7,10,13,…4, 7, 10, 13, \dots (Rule: +3+3).
    • Even terms: 25,20,15,10,…25, 20, 15, 10, \dots (Rule: −5-5).

Tier 5: Additive Accumulation, Power Transforms, and Composite Operations

Tier 5 encompasses complex operational transformations:

  1. Additive Accumulation (Fibonacci-Style): Each term is the sum of the two preceding terms: xn=xn−1+xn−2x_n = x_{n-1} + x_{n-2}.
    • Example: 2,3,5,8,13,21,34,…2, 3, 5, 8, 13, 21, 34, \dots
    • Variation (Three-term sum): xn=xn−1+xn−2+xn−3x_n = x_{n-1} + x_{n-2} + x_{n-3}.
  2. Powers with Constant Offsets: Terms map to squares, cubes, or powers of 2 modified by an offset cc:
    • n2±cn^2 \pm c: 2,5,10,17,26,…2, 5, 10, 17, 26, \dots ((n2+1)(n^2 + 1) for n=1,2,3,4,5n = 1, 2, 3, 4, 5).
    • n3±cn^3 \pm c: 0,7,26,63,124,…0, 7, 26, 63, 124, \dots ((n3−1)(n^3 - 1) for n=1,2,3,4,5n = 1, 2, 3, 4, 5).
    • 2n±c2^n \pm c: 3,5,9,17,33,65,…3, 5, 9, 17, 33, 65, \dots ((2n+1)(2^n + 1) for n=1,2,3,4,5,6n = 1, 2, 3, 4, 5, 6).
  3. Composite Linear Operations (xn+1=axn+bx_{n+1} = a x_n + b): Each term undergoes multiplication followed by addition or subtraction.
    • Example: 3,7,15,31,63,…3, 7, 15, 31, 63, \dots (Rule: ×2+1\times 2 + 1).
Loading diagram...
Systematic Sequence Diagnostic Protocol

The Rapid Difference Table Method (The 15-Second Protocol)

When a sequence does not yield its rule upon immediate inspection, execute the 15-Second Difference Table Protocol on your rough work paper:

Sequence:       2       5      11      20      32       ?
Delta 1:           +3      +6      +9     +12     [+15]
Delta 2:               +3      +3      +3

Reading the Diagnostic Signatures:

  1. If Δ1\Delta^1 is constant   ⟹  \implies Arithmetic series resolved.
  2. If Δ2\Delta^2 is constant   ⟹  \implies Quadratic series. Add Δ2\Delta^2 to the last Δ1\Delta^1 term, then add that result to the last sequence term (12+3=15  ⟹  32+15=4712 + 3 = 15 \implies 32 + 15 = 47).
  3. If Δ1\Delta^1 doubles or triples (+3,+6,+12,+24+3, +6, +12, +24)   ⟹  \implies Geometric component. Next difference is +48+48.
  4. If Δ1\Delta^1 alternates signs (+5,−3,+5,−3+5, -3, +5, -3)   ⟹  \implies Two alternating operations or interleaved series.

Essential Mental Math Benchmarks for Civil Service Aptitude

Instant pattern recognition depends on recognizing standard numerical landmarks. Civil service candidates should commit the following mathematical benchmarks to memory:

1. Integer Squares (121^2 to 25225^2)

Base nnn2n^2Base nnn2n^2Base nnn2n^2Base nnn2n^2Base nnn2n^2
11636111211625621441
24749121441728922484
39864131691832423529
416981141961936124576
52510100152252040025625

2. Integer Cubes (131^3 to 10310^3)

Base nnn3n^3Base nnn3n^3Base nnn3n^3Base nnn3n^3Base nnn3n^3
11327512573439729
2846462168512101,000

3. Powers of 2 (212^1 to 2102^{10})

Power212^1222^2232^3242^4252^5262^6272^7282^8292^92102^{10}
Value2481632641282565121,024

4. Prime Numbers Under 50

2,3,5,7,11,13,17,19,23,29,31,37,41,43,472, \quad 3, \quad 5, \quad 7, \quad 11, \quad 13, \quad 17, \quad 19, \quad 23, \quad 29, \quad 31, \quad 37, \quad 41, \quad 43, \quad 47

Note

A sequence consisting of 2,3,5,7,11,13,…2, 3, 5, 7, 11, 13, \dots is not an odd-number series (as 2 is even and 9, 15 are absent); it is the sequence of prime numbers. If the next term is requested, the answer is 17.

Test Your Knowledge

Consider the following numerical sequence:

4, 11, 22, 37, 56, ?

What number should replace the question mark?

A

75

B

77

C

79

D

81

E

83

Test Your Knowledge

Consider the following interleaved sequence with two missing terms:

5, 24, 9, 20, 13, 16, X, Y

What is the ordered pair of values (X, Y)?

A

(15, 14)

B

(16, 12)

C

(17, 12)

D

(17, 14)

E

(21, 8)

Test Your Knowledge

Consider the following sequence:

3, 5, 9, 17, 33, ?

What number should replace the question mark?

A

64

B

65

C

66

D

67

E

69

Sections you finish are checked off in the contents.