ExamFinch.com My Study

Study guide

4.1 Number & Letter Series Patterns & Formulas

Practice this exam

Ateneo College Entrance Test ACET

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Mathematics

1.1 Real Numbers, Ratios, Rates & Percentages 1.2 Algebraic Expressions, Polynomials & Linear Equations 1.3 Functions, Domain/Range, Graphs & Transformations 1.4 Quadratic, Polynomial, Exponential & Logarithmic Equations 1.5 Plane Geometry: Triangles, Circles, Polygons & Perimeter/Area 1.6 Coordinate Geometry: Lines, Distance, Midpoints & Conic Sections 1.7 Trigonometry: Right Triangle Ratios, Unit Circle & Basic Identities 1.8 Arithmetic & Geometric Sequences, Series & Word Patterns 1.9 Permutations, Combinations, Probability & Statistics

2 Chapter 2: English Proficiency

2.1 Subject-Verb Agreement, Verb Tenses & Aspect 2.2 Pronoun-Antecedent Agreement, Case, Misplaced & Dangling Modifiers 2.3 Sentence Structure, Run-Ons, Fragments & Parallelism 2.4 Contextual Vocabulary, Word Roots, Prefixes & Suffixes 2.5 Advanced Synonyms, Antonyms & Nuanced Vocabulary 2.6 Verbal Analogies: Relationship Types & Solving Strategies 2.7 Punctuation, Capitalization, Mechanics & Common Errors 2.8 Diction, Idiomatic Expressions, Prepositions & Frequently Confused Words

3 Chapter 3: Reading Comprehension

3.1 Identifying Main Ideas, Central Themes & Paragraph Summaries 3.2 Locating Explicit Details, Supporting Evidence & Data 3.3 Drawing Logical Inferences & Unstated Conclusions 3.4 Analyzing Author's Purpose, Point of View, Tone & Attitude 3.5 Interpreting Figurative Language, Tone Words & Context Clues 3.6 Text Structure, Rhetorical Devices & Evaluating Arguments

4 Chapter 4: Logical and Abstract Reasoning

4.1 Number & Letter Series Patterns & Formulas 4.2 Abstract Reasoning: Matrix Patterns & Figure Rotations 4.3 Formal Syllogisms, Categorical Logic & Deductive Proofs 4.4 Coding-Decoding, Cipher Patterns & Symbol Operations 4.5 Spatial Visualization, Paper Folding & Venn Diagram Logic

5 Chapter 5: General Knowledge

5.1 Philippine History, Government, Constitution & Civics 5.2 Integrated Science: Biology, Chemistry, Physics & Earth Science 5.3 Philippine & World Geography, Basic Economics & Cultural Facts 5.4 Current Events, World Landmarks, Literature & General Trivia

6 Chapter 6: ACET Essay Writing & Exam Strategies

6.1 ACET Essay: Thesis Development, Structuring & Argumentation 6.2 Time Allocation, Pacing Strategies & Subtest Tactics 6.3 Guessing Strategies (No Penalty), Test Anxiety & Exam Day Readiness

4.1 Number & Letter Series Patterns & Formulas

Key Takeaways Explain This Topic AI

Systematic identification of arithmetic, geometric, polynomial (first/second differences), and Fibonacci-type recursive sequences under time pressure.

Utilizing positional alphanumeric conversions (A=1, B=2, ..., Z=26) and modular arithmetic (Z+1 = A) to solve complex single and double letter series.

Master alternating and interleaved series by splitting odd and even positions into independent sub-series.

Deploying verification checks (such as checking digital roots or parity) to rapidly confirm candidate solutions without brute-force computation.

Last updated: July 2026

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 a_n a n ​ represent the n n n -th term of a sequence, where n ∈ N + = { 1 , 2 , 3 , … } n \in \mathbb{N}^+ = \{1, 2, 3, \dots\} n ∈ N + = { 1 , 2 , 3 , … } . Decoding a numerical series involves identifying the function f ( n ) f(n) f ( n ) or the recurrence relation f ( a n − 1 , a n − 2 ) f(a_{n-1}, a_{n-2}) f ( a n − 1 ​ , a n − 2 ​ ) that generates successive terms.

Primary Sequence Categories

Arithmetic Sequences (Constant First Difference) An arithmetic sequence features a constant difference d d d between consecutive terms: d = a n − a n − 1 d = a_n - a_{n-1} d = a n ​ − a n − 1 ​

The general explicit formula for the n n n -th term is: a n = a 1 + ( n − 1 ) d a_n = a_1 + (n-1)d a n ​ = a 1 ​ + ( n − 1 ) d

Example: 5 , 11 , 17 , 23 , 29 , … 5, 11, 17, 23, 29, \dots 5 , 11 , 17 , 23 , 29 , … ( d = + 6 d = +6 d = + 6 ).

Geometric Sequences (Constant Ratio) A geometric sequence maintains a constant ratio r r r between adjacent terms: r = a n a n − 1 r = \frac{a_n}{a_{n-1}} r = a n − 1 ​ a n ​ ​

The general explicit formula is: a n = a 1 ⋅ r n − 1 a_n = a_1 \cdot r^{n-1} a n ​ = a 1 ​ ⋅ r n − 1

Example: 3 , 12 , 48 , 192 , … 3, 12, 48, 192, \dots 3 , 12 , 48 , 192 , … ( r = 4 r = 4 r = 4 ).

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

First Difference ( Δ 1 \Delta^1 Δ 1 ): Δ n 1 = a n + 1 − a n \Delta^1_n = a_{n+1} - a_n Δ n 1 ​ = a n + 1 ​ − a n ​

Second Difference ( Δ 2 \Delta^2 Δ 2 ): Δ n 2 = Δ n + 1 1 − Δ n 1 \Delta^2_n = \Delta^1_{n+1} - \Delta^1_n Δ n 2 ​ = Δ n + 1 1 ​ − Δ n 1 ​

If Δ 2 \Delta^2 Δ 2 is constant, the sequence is quadratic: a n = a n 2 + b n + c a_n = an^2 + bn + c a n ​ = a n 2 + bn + c . The leading coefficient is a = Δ 2 2 a = \frac{\Delta^2}{2} a = 2 Δ 2 ​ .

If Δ 3 \Delta^3 Δ 3 is constant, the sequence is cubic: a n = a n 3 + b n 2 + c n + d a_n = an^3 + bn^2 + cn + d a n ​ = a n 3 + b n 2 + c n + d , where a = Δ 3 6 a = \frac{\Delta^3}{6} a = 6 Δ 3 ​ .

Recursive & Special Sequences

Fibonacci Series: a n = a n − 1 + a n − 2 a_n = a_{n-1} + a_{n-2} a n ​ = a n − 1 ​ + a n − 2 ​ with seeds a 1 = 1 , a 2 = 1 ⟹ 1 , 1 , 2 , 3 , 5 , 8 , 13 , 21 , … a_1 = 1, a_2 = 1 \implies 1, 1, 2, 3, 5, 8, 13, 21, \dots a 1 ​ = 1 , a 2 ​ = 1 ⟹ 1 , 1 , 2 , 3 , 5 , 8 , 13 , 21 , …

Triangular Numbers: T n = n ( n + 1 ) 2 ⟹ 1 , 3 , 6 , 10 , 15 , 21 , … T_n = \frac{n(n+1)}{2} \implies 1, 3, 6, 10, 15, 21, \dots T n ​ = 2 n ( n + 1 ) ​ ⟹ 1 , 3 , 6 , 10 , 15 , 21 , …

Square & Cube Shifts: a n = n 2 ± k a_n = n^2 \pm k a n ​ = n 2 ± k or a n = n 3 ± k a_n = n^3 \pm k a n ​ = n 3 ± k .

Prime Sequences: 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 , … 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, \dots 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 , … (Note: 1 is NOT prime).

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

Odd Indices ( a 1 , a 3 , a 5 , … a_1, a_3, a_5, \dots a 1 ​ , a 3 ​ , a 5 ​ , … ): Governed by Rule 1 ( R 1 R_1 R 1 ​ ).

Even Indices ( a 2 , a 4 , a 6 , … a_2, a_4, a_6, \dots a 2 ​ , a 4 ​ , a 6 ​ , … ): Governed by Rule 2 ( R 2 R_2 R 2 ​ ). Example: 2 , 50 , 4 , 45 , 6 , 40 , 8 , 35 , … 2, 50, 4, 45, 6, 40, 8, 35, \dots 2 , 50 , 4 , 45 , 6 , 40 , 8 , 35 , … (Odd terms + 2 +2 + 2 ; Even terms − 5 -5 − 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 , … 4, 7, 14, 25, 40, 59, \dots 4 , 7 , 14 , 25 , 40 , 59 , …

Compute First Difference ( Δ 1 \Delta^1 Δ 1 ):

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

Compute Second Difference ( Δ 2 \Delta^2 Δ 2 ):

  • 7 − 3 = 4 7 - 3 = 4 7 − 3 = 4
  • 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

Second difference is constant at Δ 2 = 4 \Delta^2 = 4 Δ 2 = 4 .

Extrapolate Next Term:

Next Δ 1 = 19 + 4 = 23 \Delta^1 = 19 + 4 = 23 Δ 1 = 19 + 4 = 23 .

Next sequence term a 7 = 59 + 23 = 82 a_7 = 59 + 23 = 82 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 A=1 A = 1 to Z = 26 Z=26 Z = 26 ):

Benchmark Anchor EJOTY : E = 5 , J = 10 , O = 15 , T = 20 , Y = 25 E=5, J=10, O=15, T=20, Y=25 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 C=3, F=6, I=9, L=12, O=15, R=18, U=21, X=24 C = 3 , F = 6 , I = 9 , L = 12 , O = 15 , R = 18 , U = 21 , X = 24 .

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

Formula: Reverse Value = 27 − Forward Value \text{Reverse Value} = 27 - \text{Forward Value} Reverse Value = 27 − Forward Value .

Complementary pairs sum to 27: A ( 1 ) + Z ( 26 ) = 27 A(1) + Z(26) = 27 A ( 1 ) + Z ( 26 ) = 27 , B ( 2 ) + Y ( 25 ) = 27 B(2) + Y(25) = 27 B ( 2 ) + Y ( 25 ) = 27 , M ( 13 ) + N ( 14 ) = 27 M(13) + N(14) = 27 M ( 13 ) + N ( 14 ) = 27 .

Alphabetic Operations & Modular Arithmetic

Alphabetical shifts wrap around modulo 26: Position n e w = ( Position o l d + k − 1 ( m o d 26 ) ) + 1 \text{Position}_{new} = (\text{Position}_{old} + k - 1 \pmod{26}) + 1 Position n e w ​ = ( Position o l d ​ + k − 1 ( mod 26 )) + 1

If shifting forward from Z ( 26 ) Z(26) Z ( 26 ) by + 3 +3 + 3 : 26 + 3 = 29 ⟹ 29 − 26 = 3 ⟹ C 26 + 3 = 29 \implies 29 - 26 = 3 \implies C 26 + 3 = 29 ⟹ 29 − 26 = 3 ⟹ C .

Pattern Types in Letter Series

Pattern Type Description Example Underlying Numeric Rule

Fixed Skip Shift forward/backward by constant k k k B , E , H , K , N B, E, H, K, N B , E , H , K , N + 3 , + 3 , + 3 , + 3 +3, +3, +3, +3 + 3 , + 3 , + 3 , + 3

Increasing Skip Step size grows arithmetically A , C , F , J , O A, C, F, J, O A , C , F , J , O + 2 , + 3 , + 4 , + 5 +2, +3, +4, +5 + 2 , + 3 , + 4 , + 5 ( P n = P n − 1 + n P_n = P_{n-1} + n P n ​ = P n − 1 ​ + n )

Alternating Direction Forward shift followed by backward shift C , G , E , I , G , K C, G, E, I, G, K C , G , E , I , G , K + 4 , − 2 , + 4 , − 2 +4, -2, +4, -2 + 4 , − 2 , + 4 , − 2

Complementary Pairs Opposite alphabet pairs A Z , B Y , C X , D W AZ, BY, CX, DW A Z , B Y , CX , D W P 1 + P 2 = 27 P_1 + P_2 = 27 P 1 ​ + P 2 ​ = 27

Alphanumeric Hybrid Letter shift combined with numeric operations B 2 D , F 6 H , J 12 L , N 20 P B2D, F6H, J12L, N20P B 2 D , F 6 H , J 12 L , N 20 P Letters + 4 +4 + 4 ; Numbers + 4 , + 6 , + 8 , + 10 +4, +6, +8, +10 + 4 , + 6 , + 8 , + 10

4. Advanced High-Yield ACET Shortcuts

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 1, 4, 9, 7, 7, 9, 4, 1, 0 1 , 4 , 9 , 7 , 7 , 9 , 4 , 1 , 0 ), providing a quick check for calculated values.

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

Boundary Inspection: In multiple-letter cluster items (e.g., A B C D , G H I J , M N O P ABCD, GHIJ, MNOP A BC D , G H I J , MNOP ), examine only the first letter of each cluster to isolate the correct option without wasting time decoding all internal letters.