5.2 Abstract Reasoning, Matrix Reasoning, and Numerical Sequence Patterns

5.2 Abstract Reasoning, Matrix Reasoning, and Numerical Sequence Patterns

Pattern exercises practice symbolic and quantitative reasoning. Look for a rule that explains all displayed terms or features and fits the options. A finite sequence can admit many mathematical continuations; prefer a simple consistent rule in the context of the supplied choices.

Pattern recognition assesses your capacity to decode structural logic. Whether analyzing a succession of numerical values representing demographic shifts or evaluating a $3 \times 3$ grid of abstract geometric figures representing multidimensional data, successful candidates systematically isolate variables, analyze step increments, and eliminate non-conforming options.

---

Numerical Sequence Typologies and Governing Formulas

Number sequences on civil service examinations are governed by precise mathematical structures:

1. Arithmetic Progressions (AP)

In an arithmetic sequence, the difference between consecutive terms is a constant common difference ($d$). The general $n$-th term is given by:

$$a_n = a_1 + (n - 1)d$$

If the sequence increases or decreases by a uniform increment (e.g., $14, 21, 28, 35, \dots$), $d = 7$. In competitive tests, $d$ may also be an integer fraction or a negative number.

2. Geometric Progressions (GP)

In a geometric sequence, each term is multiplied by a constant common ratio ($r$). The $n$-th term formula is:

$$a_n = a_1 \cdot r^{n-1}$$

Geometric sequences can feature fractional ratios ($r = 1/2$) or alternating signs ($r = -2$, generating sequences such as $3, -6, 12, -24, 48$). When numbers grow exponentially or shrink rapidly toward zero, immediately test for a geometric ratio.

3. Alternating and Interleaved Sequences

In an alternating sequence, two independent patterns are interwoven into a single line. The terms at odd ordinal positions follow Rule 1, while the terms at even ordinal positions follow Rule 2:

$$\begin{array}{lcccccccc} \text{Index:} & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 \\[2pt] \text{Term:} & \mathbf{4} & 7 & \mathbf{12} & 14 & \mathbf{36} & 28 & \mathbf{108} & ? \end{array}$$

• Odd Positions ($1, 3, 5, 7$): $4 \times 3 = 12$; $12 \times 3 = 36$; $36 \times 3 = 108$ (Geometric, $r = 3$)
• Even Positions ($2, 4, 6, 8$): $7 \times 2 = 14$; $14 \times 2 = 28$; $28 \times 2 = \mathbf{56}$ (Geometric, $r = 2$)

4. Fibonacci and Additive Recurrence Sequences

In a generalized Fibonacci sequence, each term is the sum of the preceding two terms: $a_n = a_{n-1} + a_{n-2}$. FSOE variations frequently alter the starting terms (e.g., Lucas sequences: $2, 1, 3, 4, 7, 11, 18, \dots$) or incorporate an additive constant: $a_n = a_{n-1} + a_{n-2} + k$.

5. Polynomial and Difference-Table Sequences

When adjacent differences are not constant, compute successive differences between terms in a difference table:

• First Differences ($d_1$): Difference between successive terms of the original sequence.
• Second Differences ($d_2$): Difference between successive terms of $d_1$.
• Third Differences ($d_3$): Difference between successive terms of $d_2$.

$$\begin{array}{lccccc} \text{Sequence } a_n: & 3 & 8 & 17 & 30 & 47 \\[2pt] \text{First Difference } d_1: & & 5 & 9 & 13 & 17 \\[2pt] \text{Second Difference } d_2: & & & 4 & 4 & 4 \end{array}$$

Because the second difference $d_2$ is constant ($4$), the underlying sequence is quadratic: $a_n = an^2 + bn + c$, where the leading coefficient satisfies $2a = d_2 \implies 2a = 4 \implies a = 2$. To find the next term, project $d_1$: $17 + 4 = 21$. Add this to the last term: $47 + 21 = \mathbf{68}$.

---

Abstract Visual and Matrix Reasoning

Abstract reasoning items feature geometric shapes arranged in linear progressions, $2 \times 2$ matrices, or $3 \times 3$ grids. Solving these items requires evaluating transformations across rows (horizontal) and columns (vertical):

Matrix Operations: Row-Wise vs. Column-Wise Logic

In a $3 \times 3$ matrix, always test row rules first. If Row 1 demonstrates that Cell 1 combined with Cell 2 yields Cell 3 under a specific transformation, verify that Row 2 strictly obeys the identical rule. Then apply the verified rule to Row 3 to determine the missing cell. If no consistent row rule appears, re-examine the grid along its columns.

---

The Feature Decomposition Method (No-Scrap-Paper Strategy)

Feature decomposition reduces memory demands by tracking one attribute at a time. Use scratch work only where your examination instructions permit it; the official evidence here does not establish a particular margin-only rule.

1. Separate attributes: Track outer shape, orientation, line count, and fill independently.
2. Test a rule: Verify it against every displayed position, in rows and columns where appropriate.
3. Eliminate conflicts: Remove choices that violate a confirmed feature.
4. Check the candidate: Verify all features rather than stopping after two. No success percentage or fixed 45-second guarantee is established.