ExamFinch.com My Study

Study guide

5.2 Logical Sequences, Number Patterns & Alphanumeric Series

Practice this exam

Alberta Police Cognitive Ability Test APCAT

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: APCAT Exam Overview & Alberta Police Recruitment

1.1 Exam Identity, Eligibility & Alberta Police Hiring Process 1.2 Exam Structure, Timing, Scoring & Five Cognitive Domains 1.3 Strategic Test-Taking Tactics, Time Management & Eliminating Traps

2 Chapter 2: Judgment — Incident Prioritization & Situational Decision-Making

2.1 Life Safety Hierarchy & Emergency Action Prioritization 2.2 Officer Safety Principles, Tactical Awareness & Risk Assessment 2.3 De-Escalation, Tactical Communication & Persons in Crisis

3 Chapter 3: Judgment — Ethics, Discretion & Alberta Policing Standards

3.1 Ethical Dilemmas, Integrity, Conflicts of Interest & Police Discretion 3.2 Procedural Justice, Bias-Free Policing & Charter Rights Awareness 3.3 Use of Force Continuum (Alberta Provincial Use of Force Framework) & Proportionality

4 Chapter 4: Problem Analysis — Mathematics & Numerical Reasoning

4.1 Multi-Step Arithmetic, Metric Conversions & Speed-Distance-Time 4.2 Resource Allocation, Budgeting, Percentage Calculations & Crime Rates 4.3 Ratios, Proportions & Unit Conversions in Police Operations

5 Chapter 5: Problem Analysis — Deductive Logic, Sequences & Critical Thinking

5.1 Deductive Reasoning, Syllogisms & Conditional Logic Rules 5.2 Logical Sequences, Number Patterns & Alphanumeric Series 5.3 Information Ordering, Timelines & Incident Chronology

6 Chapter 6: Observation Skills — Visual Evidence & Investigative Comparison

6.1 Alphanumeric String Verification & Multi-Witness Statement Discrepancies 6.2 Diagram, Map Reading & Crime Scene Spatial Analysis 6.3 Physical Description Accuracy, Facial Features & Vehicle Identification 6.4 Matching Diagrams to Written Descriptions & Person-in-Disguise Comparison

7 Chapter 7: Written Communication — Grammar, Syntax & Police Report Mechanics

7.1 Objective vs. Subjective Language & Professional Police Report Writing 7.2 Sentence Structure, Run-Ons, Fragments, Comma Splices & Modifiers 7.3 Punctuation, Capitalization, Quotation Rules & Possessives 7.4 Police Vocabulary, Spelling & Commonly Confused Homophones 7.5 Official Item Formats: Spelling, Closest-in-Meaning Vocabulary & "Least Grammatically Correct"

8 Chapter 8: Learning & Memory Recall — The Pretest Study Booklet

8.1 Pretest Study Booklet Overview & 30-Minute Memorization Strategy 8.2 Memorizing Suspect Profiles, Wanted Bulletins & Vehicle Descriptions 8.3 Memorizing 10-Codes, Offence Codes & Municipal Policy Procedures 8.4 Form Memorization, CAD Log Recall & Post-Retention Recall Strategies

5.2 Logical Sequences, Number Patterns & Alphanumeric Series

Key Takeaways Explain This Topic AI

APCAT sequence items test arithmetic progressions, geometric series, alternating dual-operations, second-order differences, and recursive Fibonacci-style addition.

The universal decoding protocol begins with calculating First Differences (Δ1) and Second Differences (Δ2) to identify constant, linear, or polynomial intervals.

Alphanumeric series require mapping alphabet letters to numerical indices (A=1, B=2, ..., Z=26) to reveal coordinated mathematical steps and skip patterns.

Interleaved (dual-track) series interweave two separate, independent rules across alternating odd and even sequence positions.

Matrix and grid pattern questions require systematically testing row operations, column operations, and invariant row/column sums.

Last updated: August 2026

5.2 Logical Sequences, Number Patterns & Alphanumeric Series

Cognitive Analytical Focus: Pattern recognition and sequence analysis on the Alberta Police Cognitive Ability Test (APCAT) assess your inductive-analytical ability to extract structural mathematical rules from orderly data series. Frontline officers and crime analysts routinely evaluate patterns across Computer-Aided Dispatch (CAD) call volumes, Automated Licence Plate Recognition (ALPR) datasets, patrol sector codes, and sequential occurrence timestamps.

Success on these questions requires a methodical diagnostic algorithm rather than unorganized trial-and-error. By calculating mathematical differences and mapping alphanumeric characters systematically on scrap paper, you can solve any sequence within the target 67.5-second pacing budget.

The Systematic 5-Step Sequence Decoding Protocol

When presented with any numerical or alphanumeric sequence on the APCAT, execute this 5-step diagnostic protocol: +-------------------------------------------------------------------------+

  • | STEP 1: INSPECT BASIC INTERVALS & DIRECTION |
  • | Is the series strictly increasing, strictly decreasing, or fluctuating? |
  • +-------------------------------------------------------------------------+
  • │
  • ▼
  • +-------------------------------------------------------------------------+
  • | STEP 2: CALCULATE FIRST DIFFERENCES (Δ1) |
  • | Compute (a_{n} - a_{n-1}) between all adjacent terms on scratch paper. |
  • | • Constant difference → Simple Arithmetic Series. |
  • | • Constant multiplier → Geometric Progression. |
  • +-------------------------------------------------------------------------+
  • │
  • ▼
  • +-------------------------------------------------------------------------+
  • | STEP 3: CALCULATE SECOND DIFFERENCES (Δ2) |
  • | Compute differences between the Δ1 values. |
  • | • Constant Δ2 → Second-Order (Quadratic/Polynomial) Sequence. |
  • +-------------------------------------------------------------------------+
  • │
  • ▼
  • +-------------------------------------------------------------------------+
  • | STEP 4: TEST ALTERNATING & INTERLEAVED DUAL STREAMS |
  • | Split series into odd positions (1, 3, 5...) and even positions (2, 4). |
  • | Check for dual independent sequences or alternating operations (+a, -b).|
  • +-------------------------------------------------------------------------+
  • │
  • ▼
  • +-------------------------------------------------------------------------+
  • | STEP 5: TEST RECURSIVE (FIBONACCI-STYLE) RULES |
  • | Check if each term is the sum or product of the preceding two terms. |
  • | (e.g., a_n = a_{n-1} + a_{n-2} or a_n = a_{n-1} × 2 + k). |
  • +-------------------------------------------------------------------------+
  • Core Numerical Progression Archetypes
  • 1. Constant Difference Arithmetic Series

Terms advance by adding or subtracting a constant value ( d d d ). a n = a 1 + ( n − 1 ) d a_n = a_1 + (n - 1)d a n ​ = a 1 ​ + ( n − 1 ) d

Example: 14, 21, 28, 35, 42, [ ? ]

Analysis: First difference Δ 1 = + 7 \Delta_1 = +7 Δ 1 ​ = + 7 across all terms.

Next Term: 42 + 7 = 49 42 + 7 = 49 42 + 7 = 49 .

2. Constant Ratio Geometric Series

Terms advance by multiplying or dividing by a constant factor ( r r r ). a n = a 1 × r n − 1 a_n = a_1 \times r^{n-1} a n ​ = a 1 ​ × r n − 1

Example: 3, 6, 12, 24, 48, [ ? ]

Analysis: Constant multiplier r = × 2 r = \times 2 r = × 2 .

Next Term: 48 × 2 = 96 48 \times 2 = 96 48 × 2 = 96 .

3. Two-Tier and Second-Order Difference Sequences

When the first differences ( Δ 1 \Delta_1 Δ 1 ​ ) are not constant, compute the second differences ( Δ 2 \Delta_2 Δ 2 ​ ). If Δ 2 \Delta_2 Δ 2 ​ is constant, the series follows a quadratic progression. Terms (a_n): 4 7 12 19 28 [ ? ]

  • \ / \ / \ / \ / \ /
  • First Diff (Δ1): +3 +5 +7 +9 [+11]
  • \ / \ / \ / \ /
  • Second Diff (Δ2): +2 +2 +2 [+2]

Worked Solution:

First differences ( Δ 1 \Delta_1 Δ 1 ​ ): 7 − 4 = + 3 7 - 4 = +3 7 − 4 = + 3 ; 12 − 7 = + 5 12 - 7 = +5 12 − 7 = + 5 ; 19 − 12 = + 7 19 - 12 = +7 19 − 12 = + 7 ; 28 − 19 = + 9 28 - 19 = +9 28 − 19 = + 9 .

Second differences ( Δ 2 \Delta_2 Δ 2 ​ ): 5 − 3 = + 2 5 - 3 = +2 5 − 3 = + 2 ; 7 − 5 = + 2 7 - 5 = +2 7 − 5 = + 2 ; 9 − 7 = + 2 9 - 7 = +2 9 − 7 = + 2 (constant + 2 +2 + 2 ).

Next Δ 1 \Delta_1 Δ 1 ​ : 9 + 2 = + 11 9 + 2 = +11 9 + 2 = + 11 .

Next Term: 28 + 11 = 39 28 + 11 = 39 28 + 11 = 39 .

4. Alternating Multi-Operation Series

The progression alternates between two or more distinct mathematical operations in a repeating cycle (e.g., [ × a , − b , × a , − b ] [\times a, -b, \times a, -b] [ × a , − b , × a , − b ] ). Series: 5 ──(×2)──► 10 ──(-3)──► 7 ──(×2)──► 14 ──(-3)──► 11 ──(×2)──► 22 ──(-3)──► [ ? ]

Worked Solution:

  • 5 × 2 = 10 5 \times 2 = 10 5 × 2 = 10
  • 10 − 3 = 7 10 - 3 = 7 10 − 3 = 7
  • 7 × 2 = 14 7 \times 2 = 14 7 × 2 = 14
  • 14 − 3 = 11 14 - 3 = 11 14 − 3 = 11
  • 11 × 2 = 22 11 \times 2 = 22 11 × 2 = 22

Next operation is − 3 -3 − 3 : 22 − 3 = 19 22 - 3 = 19 22 − 3 = 19 .

  • 5. Interleaved (Dual-Track) Sequences
  • Two entirely independent sequences are interwoven into odd and even positions. Position: 1 2 3 4 5 6 7 8
  • Series: 3 40 6 35 9 30 12 [ ? ]
  • │ │ │ │
  • Stream A: 3 ──(+3)─────►6 ──(+3)─────►9 ──(+3)────►12
  • │ │ │ │
  • Stream B: 40 ──(-5)────►35 ──(-5)────►30 ──(-5)────►[25]

Worked Solution:

Stream A (Odd positions: 1st, 3rd, 5th, 7th): 3 , 6 , 9 , 12 3, 6, 9, 12 3 , 6 , 9 , 12 ( + 3 +3 + 3 arithmetic step).

Stream B (Even positions: 2nd, 4th, 6th, 8th): 40 , 35 , 30 , [ ? ] 40, 35, 30, [ ? ] 40 , 35 , 30 , [ ?] ( − 5 -5 − 5 arithmetic step).

Next Term (8th position): 30 − 5 = 25 30 - 5 = 25 30 − 5 = 25 .

6. Recursive and Fibonacci-Style Additive Series

Each term is derived from the sum of the two immediately preceding terms ( a n = a n − 1 + a n − 2 a_n = a_{n-1} + a_{n-2} a n ​ = a n − 1 ​ + a n − 2 ​ ).

Standard Fibonacci: 1, 1, 2, 3, 5, 8, 13, 21, [ ? ] ⟹ 13 + 21 = 34 \implies 13 + 21 = 34 ⟹ 13 + 21 = 34 .

Modified Recursive Addition ( a n = a n − 1 + a n − 2 + k a_n = a_{n-1} + a_{n-2} + k a n ​ = a n − 1 ​ + a n − 2 ​ + k ):

Series: 2, 3, 6, 10, 17, 28, [ ? ]

Calculation: 2 + 3 + 1 = 6 2 + 3 + 1 = 6 2 + 3 + 1 = 6 ; 3 + 6 + 1 = 10 3 + 6 + 1 = 10 3 + 6 + 1 = 10 ; 6 + 10 + 1 = 17 6 + 10 + 1 = 17 6 + 10 + 1 = 17 ; 10 + 17 + 1 = 28 10 + 17 + 1 = 28 10 + 17 + 1 = 28 .

Next Term: 17 + 28 + 1 = 46 17 + 28 + 1 = 46 17 + 28 + 1 = 46 .

Alphanumeric Series & Alphabet Numerical Indexing

Alphanumeric items combine alphabetical sequences with numerical progressions. To crack these instantly, translate letters into their 1-to-26 numerical positions .

  • The 26-Letter Reference Matrix ┌───┬───┬───┬───┬───┬───┬───┬───┬───┬───┬───┬───┬───┐
  • │ A │ B │ C │ D │ E │ F │ G │ H │ I │ J │ K │ L │ M │
  • │ 1 │ 2 │ 3 │ 4 │ 5 │ 6 │ 7 │ 8 │ 9 │ 10│ 11│ 12│ 13│
  • ├───┼───┼───┼───┼───┼───┼───┼───┼───┼───┼───┼───┼───┤
  • │ N │ O │ P │ Q │ R │ S │ T │ U │ V │ W │ X │ Y │ Z │
  • │ 14│ 15│ 16│ 17│ 18│ 19│ 20│ 21│ 22│ 23│ 24│ 25│ 26│
  • └───┴───┴───┴───┴───┴───┴───┴───┴───┴───┴───┴───┴───┘

Exam Pro-Tip: Upon receiving scrap paper in the APCAT session, write out A=1 through Z=26 or the benchmark letters ( E=5, J=10, O=15, T=20, Y=25 ). This eliminates the need to count on your fingers under time pressure.

  • Skip Patterns and Directional Cycles
  • Example 1: Coordinated Alphanumeric Progression
  • Series: C03, F06, I11, L18, [ ? ]

Letter Stream: C ( 3 ) → F ( 6 ) → I ( 9 ) → L ( 12 ) ⟹ C(3) \to F(6) \to I(9) \to L(12) \implies C ( 3 ) → F ( 6 ) → I ( 9 ) → L ( 12 ) ⟹ step is + 3 +3 + 3 . Next letter is 12 + 3 = 15 ⟹ O 12 + 3 = 15 \implies O 12 + 3 = 15 ⟹ O .

Number Stream: 3 , 6 , 11 , 18 , [ ? ] 3, 6, 11, 18, [ ? ] 3 , 6 , 11 , 18 , [ ?]

First differences: 6 − 3 = + 3 6 - 3 = +3 6 − 3 = + 3 ; 11 − 6 = + 5 11 - 6 = +5 11 − 6 = + 5 ; 18 − 11 = + 7 18 - 11 = +7 18 − 11 = + 7 .

Next difference is + 9 +9 + 9 .

Next number: 18 + 9 = 27 18 + 9 = 27 18 + 9 = 27 .

Synthesized Result: O27 .

  • Example 2: Inverted Alphabet Skip with Alternating Numbers
  • Series: Z50, X46, V42, T38, [ ? ]

Letter Stream: Z ( 26 ) → X ( 24 ) → V ( 22 ) → T ( 20 ) ⟹ Z(26) \to X(24) \to V(22) \to T(20) \implies Z ( 26 ) → X ( 24 ) → V ( 22 ) → T ( 20 ) ⟹ step is − 2 -2 − 2 . Next letter is 20 − 2 = 18 ⟹ R 20 - 2 = 18 \implies R 20 − 2 = 18 ⟹ R .

Number Stream: 50 → 46 → 42 → 38 ⟹ 50 \to 46 \to 42 \to 38 \implies 50 → 46 → 42 → 38 ⟹ step is − 4 -4 − 4 . Next number is 38 − 4 = 34 38 - 4 = 34 38 − 4 = 34 .

Synthesized Result: R34 .

Matrix Patterns & Positional Shift Grids

Matrix sequence questions present a 3 × 3 3 \times 3 3 × 3 grid of numbers or letters with one cell marked with a question mark ( ? ). The underlying logic functions across rows (horizontally) or columns (vertically). ┌─────────┬─────────┬─────────┐

  • │ 4 │ 9 │ 13 │ ──► Row 1: 4 + 9 = 13
  • ├─────────┼─────────┼─────────┤
  • │ 7 │ 6 │ 13 │ ──► Row 2: 7 + 6 = 13
  • ├─────────┼─────────┼─────────┤
  • │ 5 │ 8 │ [ ? ] │ ──► Row 3: 5 + 8 = 13 (Invariant Sum Rule)
  • └─────────┴─────────┴─────────┘
  • 3x3 Matrix Diagnostic Protocols

Row Arithmetic: Check if Column 1 + Column 2 = Column 3, or Column 1 × \times × Column 2 = Column 3.

Column Arithmetic: Check if Row 1 + Row 2 = Row 3, or Row 1 × \times × Row 2 = Row 3.

Constant Sum / Product: Check if the sum of all elements across each row equals a constant value (e.g., Row 1 sum = 30, Row 2 sum = 30, Row 3 sum = 30).

Positional Shifts: In alphanumeric grids, letters may shift forward by + 1 +1 + 1 across rows and + 2 +2 + 2 down columns.

Scratch Paper Time-Management Tactics for the APCAT

Work in Columns: When calculating Δ 1 \Delta_1 Δ 1 ​ and Δ 2 \Delta_2 Δ 2 ​ , write numbers vertically down your scratch paper. Vertical arithmetic prevents alignment errors.

Verify the Entire Sequence: Never assume a rule after testing only two numbers. Verify that your rule satisfies every single given term in the prompt.

Isolate Streams: For alphanumeric or interleaved sequences, physically underline odd terms or draw brackets to visually separate the parallel streams.

Summary Matrix of Pattern Recognition Archetypes

Pattern Type Mathematical Signature Diagnostic Test Exam Example

Arithmetic a n = a n − 1 + d a_n = a_{n-1} + d a n ​ = a n − 1 ​ + d Constant Δ 1 \Delta_1 Δ 1 ​ 7, 12, 17, 22, 27 (+ 5 5 5 )

Geometric a n = a n − 1 × r a_n = a_{n-1} \times r a n ​ = a n − 1 ​ × r Constant ratio a n / a n − 1 a_n / a_{n-1} a n ​ / a n − 1 ​ 4, 12, 36, 108 ( × 3 \times 3 × 3 )

Second-Order a n = a n − 1 + Δ 1 ( n ) a_n = a_{n-1} + \Delta_1(n) a n ​ = a n − 1 ​ + Δ 1 ​ ( n ) Constant Δ 2 \Delta_2 Δ 2 ​ 2, 5, 10, 17, 26 ( Δ 1 = 3 , 5 , 7 , 9 \Delta_1 = 3,5,7,9 Δ 1 ​ = 3 , 5 , 7 , 9 )

Alternating [ Op 1 , Op 2 , Op 1 , Op 2 ] [\text{Op}_1, \text{Op}_2, \text{Op}_1, \text{Op}_2] [ Op 1 ​ , Op 2 ​ , Op 1 ​ , Op 2 ​ ] Oscillating Δ 1 \Delta_1 Δ 1 ​ signs/factors 6, 12, 9, 18, 15 ( × 2 , − 3 \times 2, -3 × 2 , − 3 )

Interleaved Dual independent series Odd vs Even position separation 2, 50, 4, 45, 6, 40 (+ 2 2 2 / - 5 5 5 )

Recursive a n = a n − 1 + a n − 2 a_n = a_{n-1} + a_{n-2} a n ​ = a n − 1 ​ + a n − 2 ​ Term equals sum of prior terms 3, 4, 7, 11, 18, 29 ( 11 + 18 = 29 11+18=29 11 + 18 = 29 )