4.1 Number & Letter Series Patterns & Formulas

Number & Letter Series Patterns & Formulas

The Logical and Abstract Reasoning subtest of the Ateneo College Entrance Test (ACET) places a massive premium on rapid pattern recognition. Number and letter series questions are designed to test your ability to discern underlying mathematical rules, recursive relationships, and positional progressions within strict time constraints. On the ACET, you typically have less than 45 seconds per question, making intuitive guesswork unreliable. To excel, you must adopt a structured, algorithmic approach to sequence decoding.

---

1. Fundamentals of Numerical Sequences

A sequence is an ordered list of numbers governed by a deterministic rule. Let $a_n$ represent the $n$-th term of a sequence, where $n \in \mathbb{N}^+ = {1, 2, 3, \dots}$. Decoding a numerical series involves identifying the function $f(n)$ or the recurrence relation $f(a_{n-1}, a_{n-2})$ that generates successive terms.

Primary Sequence Categories

1. Arithmetic Sequences (Constant First Difference) An arithmetic sequence features a constant difference $d$ between consecutive terms: $d = a_n - a_{n-1}$ The general explicit formula for the $n$-th term is: $a_n = a_1 + (n-1)d$ Example: $5, 11, 17, 23, 29, \dots$ ($d = +6$).

2. Geometric Sequences (Constant Ratio) A geometric sequence maintains a constant ratio $r$ between adjacent terms: $r = \frac{a_n}{a_{n-1}}$ The general explicit formula is: $a_n = a_1 \cdot r^{n-1}$ Example: $3, 12, 48, 192, \dots$ ($r = 4$).

3. Polynomial Sequences (Constant Higher-Order Differences) When the difference between terms is not constant, compute successive difference layers:

   • First Difference ($\Delta^1$): $\Delta^1_n = a_{n+1} - a_n$
   • Second Difference ($\Delta^2$): $\Delta^2_n = \Delta^1_{n+1} - \Delta^1_n$

   If $\Delta^2$ is constant, the sequence is quadratic: $a_n = an^2 + bn + c$. The leading coefficient is $a = \frac{\Delta^2}{2}$. If $\Delta^3$ is constant, the sequence is cubic: $a_n = an^3 + bn^2 + cn + d$, where $a = \frac{\Delta^3}{6}$.

4. Recursive & Special Sequences

   • Fibonacci Series: $a_n = a_{n-1} + a_{n-2}$ with seeds $a_1 = 1, a_2 = 1 \implies 1, 1, 2, 3, 5, 8, 13, 21, \dots$
   • Triangular Numbers: $T_n = \frac{n(n+1)}{2} \implies 1, 3, 6, 10, 15, 21, \dots$
   • Square & Cube Shifts: $a_n = n^2 \pm k$ or $a_n = n^3 \pm k$.
   • Prime Sequences: $2, 3, 5, 7, 11, 13, 17, 19, 23, 29, \dots$ (Note: 1 is NOT prime).

5. Interleaved / Alternating Sequences These series combine two independent sequences into a single line by alternating positions:

   • Odd Indices ($a_1, a_3, a_5, \dots$): Governed by Rule 1 ($R_1$).
   • Even Indices ($a_2, a_4, a_6, \dots$): Governed by Rule 2 ($R_2$). Example: $2, 50, 4, 45, 6, 40, 8, 35, \dots$ (Odd terms $+2$; Even terms $-5$).

---

2. Systematic 5-Step Solution Strategy

When presented with a complex number series on the ACET, execute the following diagnostic flowchart:

[Start: Analyze Series]
       |
       v
Is it Monotonic (strictly increasing/decreasing)?
  ├── NO  --> Test Interleaved Series (Split into odd/even positions)
  └── YES --> Check Rate of Growth
                ├── Explosive Growth  --> Test Powers (n^2, n^3) or Geometric Ratio (a_n / a_{n-1})
                ├── Steady Growth     --> Construct Difference Table (Δ^1, Δ^2, Δ^3)
                └── Hybrid/Complex    --> Test Operations (e.g., ×2 + 1, ×3 - 2)

Step-by-Step Difference Table Method

Consider the series: $4, 7, 14, 25, 40, 59, \dots$

1. Compute First Difference ($\Delta^1$):

   • $7 - 4 = 3$
   • $14 - 7 = 7$
   • $25 - 14 = 11$
   • $40 - 25 = 15$
   • $59 - 40 = 19$
   • First difference line: $3, 7, 11, 15, 19$

2. Compute Second Difference ($\Delta^2$):

   • $7 - 3 = 4$
   • $11 - 7 = 4$
   • $15 - 11 = 4$
   • $19 - 15 = 4$
   • Second difference is constant at $\Delta^2 = 4$.

3. Extrapolate Next Term:

   • Next $\Delta^1 = 19 + 4 = 23$.
   • Next sequence term $a_7 = 59 + 23 = 82$.

---

3. Letter Series & Alphanumeric Progression Rules

Letter series problems substitute numbers with position values in the English alphabet. To solve these rapidly without counting on fingers, memorize the positional mappings.

Positional Reference & Benchmarks

• Standard Forward Values ($A=1$ to $Z=26$):

  • Benchmark Anchor EJOTY: $E=5, J=10, O=15, T=20, Y=25$.
  • Additional Anchors: $C=3, F=6, I=9, L=12, O=15, R=18, U=21, X=24$.

• Reverse Values ($A=26$ to $Z=1$):

  • Formula: $\text{Reverse Value} = 27 - \text{Forward Value}$.
  • Complementary pairs sum to 27: $A(1) + Z(26) = 27$, $B(2) + Y(25) = 27$, $M(13) + N(14) = 27$.

Alphabetic Operations & Modular Arithmetic

Alphabetical shifts wrap around modulo 26: $\text{Position}_{new} = (\text{Position}_{old} + k - 1 \pmod{26}) + 1$ If shifting forward from $Z(26)$ by $+3$: $26 + 3 = 29 \implies 29 - 26 = 3 \implies C$.

Pattern Types in Letter Series

---

4. Advanced High-Yield ACET Shortcuts

1. Digital Root Verification: The digital root of a number is the single-digit sum obtained by repeatedly adding its digits. In quadratic or polynomial series, digital roots often exhibit periodic cycles (e.g., $1, 4, 9, 7, 7, 9, 4, 1, 0$), providing a quick check for calculated values.

2. Parity Isolation: Check odd/even parity transitions. An $\text{Odd} + \text{Odd} = \text{Even}$ or $\text{Even} \times \text{Odd} = \text{Even}$ rule can eliminate up to two incorrect choices instantly.

3. Boundary Inspection: In multiple-letter cluster items (e.g., $ABCD, GHIJ, MNOP$), examine only the first letter of each cluster to isolate the correct option without wasting time decoding all internal letters.