Study guide
5.2 Abstract Reasoning, Matrix Reasoning, and Numerical Sequence Patterns
Free FSOE Philippines Qualifying Test Study Guide 2026 Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Introduction, Administration, and Exam Architecture
1.1 FSOE Qualifying Test Structure, Logistics, and Testing Environment 1.2 Eligibility Requirements, Qualifications, and Application Process 1.3 80.00% Passing Standard, Career Service Eligibility, and Multi-Stage FSOE Progression
2 Chapter 2: Verbal Ability — Grammar, Structure, and Correct Usage
2.1 Subject-Verb Agreement, Inverted Sentences, and Parallel Structure 2.2 Verb Tense Consistency, Aspect, Mood, and Verbals 2.3 Pronoun Case, Relative Pronouns, and Modifier Placement 2.4 Idiomatic Prepositions, Diction, Word Choice, and Common Usage Errors
3 Chapter 3: Verbal Ability — Vocabulary, Organization, and Reading
3.1 Advanced Contextual Vocabulary, Etymology, Roots, Prefixes, and Suffixes 3.2 Paragraph Organization, Transitional Devices, Cohesion, and Sentence Ordering 3.3 Critical Reading Comprehension, Tone Analysis, Main Ideas, and Inferences 3.4 Filipino Language Proficiency: Wastong Gamit, Talasalitaan, at Pag-unawa sa Binasa
4 Chapter 4: Analytical Ability — Logical Reasoning and Deduction
4.1 Categorical Propositions, Syllogistic Forms, and Validity Tests 4.2 Conditional Logic (Modus Ponens, Modus Tollens) and Formal/Informal Fallacies 4.3 Evaluating Assumptions, Strengths of Arguments, and Sound Conclusions 4.4 Venn Diagrams, Euler Circles, and Three-Set Quantifier Logic
5 Chapter 5: Analytical Ability — Analogies, Patterns, and Data Interpretation
5.1 Verbal Analogies and Complex Semantic Relationships 5.2 Abstract Reasoning, Matrix Reasoning, and Numerical Sequence Patterns 5.3 Data Interpretation: Tables, Bar Graphs, Line Graphs, and Pie Charts 5.4 Data Sufficiency: Framework, Evaluation Strategy, and Answer Determination
6 Chapter 6: Numerical Ability — Arithmetic, Percentages, and Proportions
6.1 Number Properties, Divisibility Rules, Prime Factorization, and Mental Math Shortcuts 6.2 Fractions, Decimals, Percentages, and Percentage Change 6.3 Ratios, Proportions, Partitive Proportions, and Inverse/Direct Variation 6.4 Rate Problems, Combined Work Equations, and Weighted Mixture Calculations
7 Chapter 7: Numerical Ability — Algebraic Reasoning and Applied Problems
7.1 Linear Equations, Inequalities, and Systems of Equations 7.2 Applied Age Word Problems, Uniform Motion, and Relative Speed 7.3 Practical Financial Math, Simple Interest, Commercial Discounts, and Currency Conversions
8 Chapter 8: Managerial Ability — Leadership, Administration, and Problem Solving
8.1 Core Management Functions (POLC) and Organizational Governance Principles 8.2 Strategic Planning, Decision-Making Matrices, SWOT Analysis, and Risk Assessment 8.3 Situational Judgment in Public Administration and Crisis Response 8.4 Supervisory Practices, Team Motivation, and Workplace Conflict Resolution
9 Chapter 9: Supplemental Public-Service Ethics and Foreign-Service Context
9.1 Republic Act No. 6713: The Eight Norms of Conduct and Public Duties 9.2 Prohibited Acts, Gifts, Conflict of Interest, Divestment, and SALN Compliance 9.3 Republic Act No. 7157 (Philippine Foreign Service Act of 1991): Ranks, BFSE, and Structure 9.4 Diplomatic Mission Functions, Consular Assistance to Nationals, and Crisis Leadership
5.2 Abstract Reasoning, Matrix Reasoning, and Numerical Sequence Patterns
Key Takeaways Explain This Topic AI
Numerical sequences on the CSE-FSO follow identifiable mathematical classifications: arithmetic progressions (constant d), geometric progressions (constant ratio r), alternating series, and polynomial difference tables.
Difference-table analysis reveals polynomial degrees: a constant second difference (d2) signifies a quadratic sequence governed by an^2 + bn + c, where d2 = 2a.
Abstract matrix reasoning (2x2 and 3x3 grids) requires horizontal and vertical evaluation of geometric transformations: rotational increments, axial reflections, Boolean set operations, and cyclic shading shifts.
Boolean operations across matrix rows—such as XOR cancellation (lines appearing in both precursor cells are removed, lines in only one cell are retained)—are frequent high-difficulty patterns on the qualifying test.
The Feature Decomposition method eliminates distractors systematically without scrap paper by isolating one graphical dimension (outline shape, internal segment count, orientation, fill) at a time.
Last updated: October 2026
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 × 3 3 \times 3 3 × 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 d d ). The general n n n -th term is given by: a n = a 1 + ( n − 1 ) d a_n = a_1 + (n - 1)d a n = a 1 + ( n − 1 ) d
If the sequence increases or decreases by a uniform increment (e.g., 14 , 21 , 28 , 35 , … 14, 21, 28, 35, \dots 14 , 21 , 28 , 35 , … ), d = 7 d = 7 d = 7 . In competitive tests, d d 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 r r ). The n n n -th term formula is: a n = a 1 ⋅ r n − 1 a_n = a_1 \cdot r^{n-1} a n = a 1 ⋅ r n − 1
Geometric sequences can feature fractional ratios ( r = 1 / 2 r = 1/2 r = 1/2 ) or alternating signs ( r = − 2 r = -2 r = − 2 , generating sequences such as 3 , − 6 , 12 , − 24 , 48 3, -6, 12, -24, 48 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: Index: 1 2 3 4 5 6 7 8 Term: 4 7 12 14 36 28 108 ? \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} Index: Term: 1 4 2 7 3 12 4 14 5 36 6 28 7 108 8 ?
Odd Positions ( 1 , 3 , 5 , 7 1, 3, 5, 7 1 , 3 , 5 , 7 ): 4 × 3 = 12 4 \times 3 = 12 4 × 3 = 12 ; 12 × 3 = 36 12 \times 3 = 36 12 × 3 = 36 ; 36 × 3 = 108 36 \times 3 = 108 36 × 3 = 108 (Geometric, r = 3 r = 3 r = 3 )
Even Positions ( 2 , 4 , 6 , 8 2, 4, 6, 8 2 , 4 , 6 , 8 ): 7 × 2 = 14 7 \times 2 = 14 7 × 2 = 14 ; 14 × 2 = 28 14 \times 2 = 28 14 × 2 = 28 ; 28 × 2 = 56 28 \times 2 = \mathbf{56} 28 × 2 = 56 (Geometric, r = 2 r = 2 r = 2 )
Tip
Interleaving is one possible sequence rule; its frequency on the official examination is not published.
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 a_n = a_{n-1} + a_{n-2} 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 , … 2, 1, 3, 4, 7, 11, 18, \dots 2 , 1 , 3 , 4 , 7 , 11 , 18 , … ) or incorporate an additive constant: 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 .
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 d_1 d 1 ): Difference between successive terms of the original sequence.
Second Differences ( d 2 d_2 d 2 ): Difference between successive terms of d 1 d_1 d 1 .
Third Differences ( d 3 d_3 d 3 ): Difference between successive terms of d 2 d_2 d 2 . Sequence a n : 3 8 17 30 47 First Difference d 1 : 5 9 13 17 Second Difference d 2 : 4 4 4 \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} Sequence a n : First Difference d 1 : Second Difference d 2 : 3 8 5 17 9 4 30 13 4 47 17 4
Because the second difference d 2 d_2 d 2 is constant ( 4 4 4 ), the underlying sequence is quadratic: a n = a n 2 + b n + c a_n = an^2 + bn + c a n = a n 2 + bn + c , where the leading coefficient satisfies 2 a = d 2 ⟹ 2 a = 4 ⟹ a = 2 2a = d_2 \implies 2a = 4 \implies a = 2 2 a = d 2 ⟹ 2 a = 4 ⟹ a = 2 . To find the next term, project d 1 d_1 d 1 : 17 + 4 = 21 17 + 4 = 21 17 + 4 = 21 . Add this to the last term: 47 + 21 = 68 47 + 21 = \mathbf{68} 47 + 21 = 68 .
Abstract Visual and Matrix Reasoning
Abstract reasoning items feature geometric shapes arranged in linear progressions, 2 × 2 2 \times 2 2 × 2 matrices, or 3 × 3 3 \times 3 3 × 3 grids. Solving these items requires evaluating transformations across rows (horizontal) and columns (vertical):
Transformation Type Visual Mechanism Diagnostic Indicator
Angular Rotation Elements rotate around a central axis by fixed angles ( 45 ∘ , 90 ∘ , 135 ∘ , 180 ∘ 45^\circ, 90^\circ, 135^\circ, 180^\circ 4 5 ∘ , 9 0 ∘ , 13 5 ∘ , 18 0 ∘ ) Flag or pointer elements shifting clockwise or counter-clockwise
Planar Reflection Elements invert across horizontal, vertical, or diagonal symmetry axes Asymmetric shapes mirroring their orientation across adjacent cells
Component Arithmetic Segments, dots, or shapes are added or subtracted sequentially Monotonic increase or decrease in the quantity of discrete visual items
Boolean XOR (Exclusive OR) Line segments in Cells 1 and 2 are combined; overlapping lines cancel, unique lines persist Central cell contains overlapping segments that vanish in the final column
Cyclic Shading Shifts Shading alternates cyclically (e.g., solid → \rightarrow → striped → \rightarrow → dotted → \rightarrow → blank) Shading pattern advances by a constant modular step across consecutive cells
Perimeter Token Migration A small dot or symbol traverses the perimeter corners of a polygon Predictable corner-to-corner tracking along clockwise or counter-clockwise borders
Matrix Operations: Row-Wise vs. Column-Wise Logic
In a 3 × 3 3 \times 3 3 × 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.
Separate attributes: Track outer shape, orientation, line count, and fill independently.
Test a rule: Verify it against every displayed position, in rows and columns where appropriate.
Eliminate conflicts: Remove choices that violate a confirmed feature.
Check the candidate: Verify all features rather than stopping after two. No success percentage or fixed 45-second guarantee is established.