Study guide
7.1 Arithmetic, Geometric & Two-Stage Number Sequences
Irish Public Service Numerical Reasoning Test Study Guide Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Test Overview, Structure & Assessment Strategies
1.1 Test Overview, Structure & Administration 1.2 Pacing, Time Management & Exam Strategies 1.3 Assessment Interfaces, Tabbed Layouts & 'Cannot Say' Logic
2 Chapter 2: Core Arithmetic, Fractions & Decimals
2.1 Order of Operations & Mental Arithmetic Techniques 2.2 Fractions & Rational Numbers in Public Administration 2.3 Decimals, Rounding & Unit Conversions
3 Chapter 3: Percentages, Ratios & Proportions
3.1 Percentage Calculation & Base Identification 3.2 Percentage Change, Reverse Percentages & Multipliers 3.3 Ratios, Partitioning & Proportional Allocation 3.4 Rates, Staffing Metrics & Weighted Averages
4 Chapter 4: Statistical Tables & Bar Charts
4.1 Tabular Data Interpretation & Footnote Traps 4.2 Bar Charts, Clustered Bars & Segmented Stacks 4.3 Histograms & Frequency Distributions in Civil Service Reporting
5 Chapter 5: Line Graphs, Pie Charts & Multi-Source Synthesis
5.1 Line Graphs, Time Series & Trend Analysis 5.2 Pie Charts & Proportional Sector Expenditure 5.3 Multi-Source Data Synthesis & Cross-Referencing
6 Chapter 6: Financial Computations & Public Expenditure
6.1 Public Sector Budgeting, Allocation & Variance Analysis 6.2 Unit Costing, Service Delivery & Economies of Scale 6.3 Taxation, VAT & Net-to-Gross Calculations 6.4 Inflation, Indexation & Real vs Nominal Values
7 Chapter 7: Numerical Series, Sequences & Rapid Estimation
7.1 Arithmetic, Geometric & Two-Stage Number Sequences 7.2 Interleaved, Fibonacci & Pattern Recognition Series 7.3 High-Speed Estimation, Rounding & Order-of-Magnitude Filtering 7.4 Distractor Analysis, Unit Verification & Sanity Checking
7.1 Arithmetic, Geometric & Two-Stage Number Sequences
Key Takeaways Explain This Topic AI
Arithmetic sequences advance by a constant common difference d; geometric sequences multiply each term by a constant common ratio r.
For unit-spaced indices, a quadratic polynomial with nonzero leading coefficient a has constant second difference 2a. A matching finite prefix supports that model without proving unique continuation.
Compare terms with benchmark squares and cubes when a power-based rule is specified or being tested; verify the proposed formula against all supplied terms.
A finite pattern suggests a model but does not prove unique continuation; use the rule family or recurrence stated by the task.
Last updated: October 2026
7.1 Arithmetic, Geometric & Two-Stage Number Sequences
This chapter offers optional number-pattern practice alongside numerical data interpretation. Publicjobs describes logical thinking separately from numerical reasoning; do not assume these patterns form part of every numerical assessment or have a fixed question time.
A sequence is an ordered list; in formal mathematics, a series is a sum of terms. Pattern exercises often use “number series” informally for a sequence. A finite prefix can fit more than one rule. The exercises here specify a rule family or recurrence so that continuation is conditional on that model, rather than proof that no other continuation exists.
Linear Arithmetic Progressions (Constant First Difference Δ 1 \Delta_1 Δ 1 )
An arithmetic progression is the most fundamental sequence type. Each successive term is generated by adding or subtracting a fixed constant, known as the common difference ( d d d ):
T n = a + ( n − 1 ) d T_n = a + (n - 1)d T n = a + ( n − 1 ) d
Where a a a is the initial term and d d d is the common difference ( T n − T n − 1 = d T_n - T_{n-1} = d T n − T n − 1 = d ).
Characteristics and Variants
Positive and Negative Steps : Common differences can be positive integers ( + 6 , + 14 +6, +14 + 6 , + 14 ), negative integers ( − 5 , − 11 -5, -11 − 5 , − 11 ), or fractional and decimal values ( + 2.5 , − 0.75 +2.5, -0.75 + 2.5 , − 0.75 ).
Diagnostic Rule : If the first difference row ( Δ 1 \Delta_1 Δ 1 ) between consecutive terms is strictly identical through the observed terms, those terms fit an arithmetic model. The rule or problem assumptions determine its continuation.
Administrative Context : A hypothetical model with fixed annual retirements or constant weekly additions can use an arithmetic sequence, provided the rule is explicitly stated.
Example: 17 , 24 , 31 , 38 , 45 , 52 ⟹ Δ 1 = + 7 ( Constant ) \text{Example: } 17, 24, 31, 38, 45, 52 \implies \Delta_1 = +7 \quad (\text{Constant}) Example: 17 , 24 , 31 , 38 , 45 , 52 ⟹ Δ 1 = + 7 ( Constant )
Geometric Progressions (Common Ratio r r r )
A geometric sequence advances not by constant addition, but through continuous multiplication or division by a fixed factor, termed the common ratio ( r r r ):
T n = a ⋅ r n − 1 T_n = a \cdot r^{n-1} T n = a ⋅ r n − 1
The recurrence is T n = r T n − 1 T_n=rT_{n-1} T n = r T n − 1 for n ≥ 2 n\ge2 n ≥ 2 . When the preceding term is nonzero, its ratio can be found from: r = T n T n − 1 r = \frac{T_n}{T_{n-1}} r = T n − 1 T n .
Growth Profiles and Alternating Signs
Expansive Growth ( ∣ r ∣ > 1 |r| > 1 ∣ r ∣ > 1 ) : For a nonzero initial term, absolute values grow geometrically (e.g., × 2 , × 3 , × 1.5 \times 2, \times 3, \times 1.5 × 2 , × 3 , × 1.5 ).
Contractive Decay ( 0 < ∣ r ∣ < 1 0 < |r| < 1 0 < ∣ r ∣ < 1 ) : Terms shrink toward zero (e.g., × 0.5 , × 2 3 \times 0.5, \times \frac{2}{3} × 0.5 , × 3 2 ).
Oscillating Signs ( r < 0 r < 0 r < 0 ) : With a nonzero seed and negative ratio, terms alternate between positive and negative values (e.g., 3 , − 6 , 12 , − 24 , 48 ⟹ r = − 2 3, -6, 12, -24, 48 \implies r = -2 3 , − 6 , 12 , − 24 , 48 ⟹ r = − 2 ).
Diagnostic Rule : When the differences between adjacent terms ( Δ 1 \Delta_1 Δ 1 ) increase or decrease in direct proportion to the terms themselves, evaluate the ratio T n T n − 1 \frac{T_{n}}{T_{n-1}} T n − 1 T n . If the quotient remains invariant, the sequence is geometric.
Example: 8 , 20 , 50 , 125 , 312.5 ⟹ r = 20 8 = 50 20 = 2.5 \text{Example: } 8, 20, 50, 125, 312.5 \implies r = \frac{20}{8} = \frac{50}{20} = 2.5 Example: 8 , 20 , 50 , 125 , 312.5 ⟹ r = 8 20 = 20 50 = 2.5
Power-Based Sequences: Squares, Cubes, and Polynomial Offsets
Psychometric item writers frequently construct sequences based on exponents, as raw differences can appear confusing without recognition of the underlying powers.
Benchmark Powers to Memorize
Benchmark powers provide useful reference values:
Benchmark Squares ( n 2 n^2 n 2 ) : 1 , 4 , 9 , 16 , 25 , 36 , 49 , 64 , 81 , 100 , 121 , 144 , 169 , 196 , 225 , 256 , 289 , 324 , 361 , 400 1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169, 196, 225, 256, 289, 324, 361, 400 1 , 4 , 9 , 16 , 25 , 36 , 49 , 64 , 81 , 100 , 121 , 144 , 169 , 196 , 225 , 256 , 289 , 324 , 361 , 400 .
Benchmark Cubes ( n 3 n^3 n 3 ) : 1 , 8 , 27 , 64 , 125 , 216 , 343 , 512 , 729 , 1,000 1, 8, 27, 64, 125, 216, 343, 512, 729, 1{,}000 1 , 8 , 27 , 64 , 125 , 216 , 343 , 512 , 729 , 1 , 000 .
Constant-Offset Power Series ( n 2 ± k n^2 \pm k n 2 ± k and n 3 ± k n^3 \pm k n 3 ± k )
In these sequences, a uniform integer k k k is added to or subtracted from each successive power:
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 , …
n 2 − 2 n^2 - 2 n 2 − 2 : − 1 , 2 , 7 , 14 , 23 , 34 , 47 , … -1, 2, 7, 14, 23, 34, 47, \dots − 1 , 2 , 7 , 14 , 23 , 34 , 47 , …
n 3 − 1 n^3 - 1 n 3 − 1 : 0 , 7 , 26 , 63 , 124 , 215 , 342 , … 0, 7, 26, 63, 124, 215, 342, \dots 0 , 7 , 26 , 63 , 124 , 215 , 342 , …
Index-Variable Power Series ( n 2 ± n n^2 \pm n n 2 ± n and n 3 ± n n^3 \pm n n 3 ± n )
Here, the offset is not fixed, but equals the index n n n of the term itself:
n 2 − n n^2 - n n 2 − n (or n ( n − 1 ) n(n-1) n ( n − 1 ) ) : 0 , 2 , 6 , 12 , 20 , 30 , 42 , 56 , … 0, 2, 6, 12, 20, 30, 42, 56, \dots 0 , 2 , 6 , 12 , 20 , 30 , 42 , 56 , … (commonly called pronic numbers) .
n 2 + n n^2 + n n 2 + n (or n ( n + 1 ) n(n+1) n ( n + 1 ) ) : 2 , 6 , 12 , 20 , 30 , 42 , 56 , 72 , … 2, 6, 12, 20, 30, 42, 56, 72, \dots 2 , 6 , 12 , 20 , 30 , 42 , 56 , 72 , …
n 3 − n n^3 - n n 3 − n : 0 , 6 , 24 , 60 , 120 , 210 , 336 , … 0, 6, 24, 60, 120, 210, 336, \dots 0 , 6 , 24 , 60 , 120 , 210 , 336 , …
Tip
Whenever a sequence begins with numbers such as 0 , 2 , 6 , 12 , 20 0, 2, 6, 12, 20 0 , 2 , 6 , 12 , 20 or 0 , 6 , 24 , 60 0, 6, 24, 60 0 , 6 , 24 , 60 , test the factored forms n ( n − 1 ) n(n-1) n ( n − 1 ) or n ( n 2 − 1 ) n(n^2-1) n ( n 2 − 1 ) immediately before calculating difference tiers.
Two-Stage / Quadratic Sequences (Differences of Differences Δ 2 \Delta_2 Δ 2 )
When the first differences between consecutive terms ( Δ 1 \Delta_1 Δ 1 ) are not constant, candidates must examine the second difference row ( Δ 2 \Delta_2 Δ 2 ). At consecutive integer indices with step 1, a quadratic formula has constant nonzero second differences. An observed finite prefix with that signature fits a quadratic continuation; zero second differences instead fit a linear or constant sequence.
Mathematical Formulation
A quadratic sequence conforms to the second-order polynomial equation:
T n = a n 2 + b n + c T_n = an^2 + bn + c T n = a n 2 + bn + c
The first difference row ( Δ 1 \Delta_1 Δ 1 ) forms an arithmetic progression with common difference 2 a 2a 2 a .
The second difference row ( Δ 2 \Delta_2 Δ 2 ) is constant and equal to 2 a 2a 2 a .
Systematic Diagnostic Walkthrough
Consider the sequence: 5 , 12 , 23 , 38 , 57 , ? 5, 12, 23, 38, 57, ? 5 , 12 , 23 , 38 , 57 , ?
Compute First Differences ( Δ 1 \Delta_1 Δ 1 ) : 12 − 5 = 7 12 - 5 = 7 12 − 5 = 7 23 − 12 = 11 23 - 12 = 11 23 − 12 = 11 38 − 23 = 15 38 - 23 = 15 38 − 23 = 15 57 − 38 = 19 57 - 38 = 19 57 − 38 = 19 The first differences are 7 , 11 , 15 , 19 7, 11, 15, 19 7 , 11 , 15 , 19 . They are not constant, ruling out a simple linear arithmetic progression.
Compute Second Differences ( Δ 2 \Delta_2 Δ 2 ) : 11 − 7 = 4 11 - 7 = 4 11 − 7 = 4 15 − 11 = 4 15 - 11 = 4 15 − 11 = 4 19 − 15 = 4 19 - 15 = 4 19 − 15 = 4 The second differences are constant at Δ 2 = + 4 \Delta_2 = +4 Δ 2 = + 4 .
Project the Next Step :
Extend the first difference row: 19 + 4 = 23 19 + 4 = 23 19 + 4 = 23 .
Add this extended difference to the final known term: 57 + 23 = 80 57 + 23 = 80 57 + 23 = 80 .
Under the constant-second-difference rule, the next term is 80 .
The Systematic 4-Step Sequence Triage Protocol
Under timed psychometric assessment conditions, avoid random guessing. Execute this four-step triage procedure on your scratch sheet: [Step 1: Growth Velocity Inspection]
- │
- ├── Steady / Slow Growth ─────────► Check Linear Arithmetic (+d / -d)
- ├── Rapid / Accelerating Growth ──► Check Quadratic (Delta_2) or Squares (n^2)
- └── Explosive Growth ─────────────► Check Geometric (* r) or Cubes (n^3)
- │
- [Step 2: Construct Delta_1 (First Differences)]
- │
- ├── Delta_1 is Constant ──────────► Linear Arithmetic: T_next = T_last + d
- └── Delta_1 is Non-Constant ──────► Proceed to Step 3
- │
- [Step 3: Construct Delta_2 (Second Differences)]
- │
- ├── Delta_2 is Constant ──────────► Quadratic: Extend Delta_1, then compute T_next
- └── Delta_2 is Non-Constant ──────► Proceed to Step 4
- │
- [Step 4: Check Multiplicative Ratios & Power Offsets]
- ├── Test Constant Ratio (T_n / T_{n-1} = r)
- └── Test Proximity to Benchmark Powers (n^2 +/- k, n^3 +/- k)
- Sequence Taxonomy & Diagnostic Rules Reference
The following reference table outlines the primary single-rule sequence categories, their mathematical formulations, and their difference signatures:
Sequence Category Defining Formula First Difference Row ( Δ 1 \Delta_1 Δ 1 ) Second Difference Row ( Δ 2 \Delta_2 Δ 2 ) Diagnostic Indicator Practice Example
Linear Arithmetic T n = a + ( n − 1 ) d T_n = a + (n-1)d T n = a + ( n − 1 ) d Constant value ( d d d ) Zero ( 0 0 0 ) Uniform numerical steps between adjacent values 14 , 23 , 32 , 41 , 50 ⟹ d = + 9 14, 23, 32, 41, 50 \implies d = +9 14 , 23 , 32 , 41 , 50 ⟹ d = + 9
Geometric Progression T n = a ⋅ r n − 1 T_n = a \cdot r^{n-1} T n = a ⋅ r n − 1 For ordinary nonconstant examples, differences scale by r r r Can depend on a , r a,r a , r ; not a universal nonconstant signature Use the recurrence; divide adjacent terms only when the previous term is nonzero 6 , 18 , 54 , 162 , 486 ⟹ r = 3 6, 18, 54, 162, 486 \implies r = 3 6 , 18 , 54 , 162 , 486 ⟹ r = 3
Quadratic Sequence T n = a n 2 + b n + c T_n = an^2 + bn + c T n = a n 2 + bn + c Forms arithmetic progression Constant value ( 2 a 2a 2 a ) Linearly increasing or decreasing difference row 4 , 11 , 22 , 37 , 56 ⟹ Δ 2 = + 4 4, 11, 22, 37, 56 \implies \Delta_2 = +4 4 , 11 , 22 , 37 , 56 ⟹ Δ 2 = + 4
Cubic Progression T n = a n 3 + … T_n = an^3 + \dots T n = a n 3 + … Forms quadratic progression Forms arithmetic progression Third difference row ( Δ 3 \Delta_3 Δ 3 ) is constant ( 6 a 6a 6 a ) 2 , 9 , 28 , 65 , 126 ⟹ n 3 + 1 2, 9, 28, 65, 126 \implies n^3 + 1 2 , 9 , 28 , 65 , 126 ⟹ n 3 + 1
Pronic / Factor Series T n = n ( n ± 1 ) T_n = n(n \pm 1) T n = n ( n ± 1 ) Increases by + 2 +2 + 2 at each step Constant at + 2 +2 + 2 Consecutive products: 1 × 2 , 2 × 3 , 3 × 4 1 \times 2, 2 \times 3, 3 \times 4 1 × 2 , 2 × 3 , 3 × 4 2 , 6 , 12 , 20 , 30 , 42 ⟹ n ( n + 1 ) 2, 6, 12, 20, 30, 42 \implies n(n+1) 2 , 6 , 12 , 20 , 30 , 42 ⟹ n ( n + 1 )
Alternating Geometric T n = a r n − 1 T_n = ar^{n-1} T n = a r n − 1 with r < 0 r<0 r < 0 , a ≠ 0 a\ne0 a = 0 Magnitudes grow, shrink or stay fixed according to ∣ r ∣ \lvert r\rvert ∣ r ∣ Do not infer a fixed second-difference signature Terms alternate in sign 5 , − 15 , 45 , − 135 , 405 ⟹ r = − 3 5, -15, 45, -135, 405 \implies r = -3 5 , − 15 , 45 , − 135 , 405 ⟹ r = − 3
Note
For polynomial sequences at index step 1, a cubic with nonzero leading coefficient a a a has constant third difference 6 a 6a 6 a . Recognising a power offset can be an alternative to calculating several difference rows. Check it against every supplied term; no particular test prevalence or solving-time guarantee follows.