Study guide

6.1 Number Properties, Divisibility Rules, Prime Factorization, and Mental Math Shortcuts

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

6.1 Number Properties, Divisibility Rules, Prime Factorization, and Mental Math Shortcuts

Key Takeaways Explain This Topic AI

In the strictly calculator-free CSE-FSO Qualifying Test, master foundational number properties (integers, rational numbers, parity rules) to eliminate impossible options without manual calculation.

Apply core divisibility rules (2 through 12), leveraging coprime factor decomposition and alternating digit sums to verify tracking codes and financial figures rapidly.

Determine Greatest Common Factors (GCF) and Least Common Multiples (LCM) via prime factorization to solve recurring consular outreach and diplomatic logistics problems.

Enforce strict PEMDAS/BODMAS operational precedence from left to right for multiplication/division and addition/subtraction, avoiding the widespread operational priority trap.

Deploy calculator-free mental math shortcuts—including benchmarking, distributive factoring, multiplying by 5, 25, and 50, and squaring numbers ending in 5—to solve questions in under 60 seconds.

Last updated: October 2026

6.1 Number Properties, Divisibility Rules, Prime Factorization, and Mental Math Shortcuts

Important

The published numerical scope is word problems. Number properties and mental arithmetic support solving those problems without a calculator. No official numerical-domain item count or time budget is published.

Numerical Ability in the Foreign Service Officer Examination does not test obscure higher-level calculus; instead, it rigorously measures quantitative agility, logical precision, and operational speed under severe time constraints. Diplomatic officers must audit foreign assistance disbursements, analyze bilateral tariff structures, evaluate consular visa workloads, and inspect logistical quotas without relying on electronic spreadsheets or computing gadgets. Building fluency in foundational number properties and shortcut arithmetic transforms time-consuming long division into rapid, sub-minute eliminations.

Number Classifications and Core Mathematical Properties

A rigorous grasp of number sets provides the theoretical foundation for quantitative reasoning:

Natural Numbers ( N \mathbb{N} N ) : The set of positive counting integers: { 1 , 2 , 3 , 4 , … } \{1, 2, 3, 4, \dots\} { 1 , 2 , 3 , 4 , … } .

Whole Numbers : Natural numbers including zero: { 0 , 1 , 2 , 3 , … } \{0, 1, 2, 3, \dots\} { 0 , 1 , 2 , 3 , … } .

Integers ( Z \mathbb{Z} Z ) : All positive and negative whole numbers, including zero: { … , − 3 , − 2 , − 1 , 0 , 1 , 2 , 3 , … } \{\dots, -3, -2, -1, 0, 1, 2, 3, \dots\} { … , − 3 , − 2 , − 1 , 0 , 1 , 2 , 3 , … } .

Rational Numbers ( Q \mathbb{Q} Q ) : Any number that can be expressed as a quotient a b \frac{a}{b} b a ​ , where a , b ∈ Z a, b \in \mathbb{Z} a , b ∈ Z and b ≠ 0 b \neq 0 b  = 0 . Rational numbers encompass terminating decimals (e.g., 0.75 = 3 4 0.75 = \frac{3}{4} 0.75 = 4 3 ​ ) and repeating decimals (e.g., 0. 3 ˉ = 1 3 0.\bar{3} = \frac{1}{3} 0. 3 ˉ = 3 1 ​ ).

Irrational Numbers : Numbers that cannot be expressed as a ratio of integers and possess non-terminating, non-repeating decimal expansions (e.g., 2 , 3 , π \sqrt{2}, \sqrt{3}, \pi 2 ​ , 3 ​ , π ).

Real Numbers ( R \mathbb{R} R ) : The union of all rational and irrational numbers.

The Special Algebraic Status of Zero

Zero is a frequent source of traps in civil service quantitative items:

Parity : 0 0 0 is an even integer because it satisfies the formal definition 2 k 2k 2 k (where k = 0 k = 0 k = 0 ).

Sign : 0 0 0 is neither positive nor negative ; it serves as the neutral origin on the real number line.

Additive Identity : For any real number x x x , x + 0 = x x + 0 = x x + 0 = x .

Multiplication by Zero : x × 0 = 0 x \times 0 = 0 x × 0 = 0 .

Division Rules : 0 x = 0 \frac{0}{x} = 0 x 0 ​ = 0 for any non-zero real number x x x . Conversely, division by zero is mathematically undefined (e.g., x 0 \frac{x}{0} 0 x ​ has no defined value), and 0 0 \frac{0}{0} 0 0 ​ is undefined.

Prime and Composite Numbers

A prime number is an integer strictly greater than 1 1 1 whose only positive divisors are 1 1 1 and itself.

The integer 1 1 1 is neither prime nor composite because by definition a prime must have exactly two distinct positive divisors.

The integer 2 2 2 is the smallest prime number and the only even prime . All other even numbers are multiples of 2 and therefore composite.

Primes Under 100 : There are exactly 25 prime numbers between 1 and 100 that every FSO candidate should know by sight: 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 , 31 , 37 , 41 , 43 , 47 , 53 , 59 , 61 , 67 , 71 , 73 , 79 , 83 , 89 , 97 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 , 31 , 37 , 41 , 43 , 47 , 53 , 59 , 61 , 67 , 71 , 73 , 79 , 83 , 89 , 97

Parity Rules and Sign Arithmetic

Parity refers to whether an integer is even or odd. In competitive civil service questions, parity analysis enables you to determine whether an answer must be even or odd before performing lengthy calculations.

Operation Parity Rule Algebraic Justification Practical Example

Addition / Subtraction Even ± Even = Even \text{Even} \pm \text{Even} = \text{Even} Even ± Even = Even 2 a ± 2 b = 2 ( a ± b ) 2a \pm 2b = 2(a \pm b) 2 a ± 2 b = 2 ( a ± b ) 14 + 8 = 22 14 + 8 = 22 14 + 8 = 22

Odd ± Odd Even Addition: 2 ( a + b + 1 ) 2(a+b+1) 2 ( a + b + 1 ) ; subtraction: 2 ( a − b ) 2(a-b) 2 ( a − b ) 7 + 5 = 12 7+5=12 7 + 5 = 12 ; 7 − 5 = 2 7-5=2 7 − 5 = 2

Addition / Subtraction Even ± Odd = Odd \text{Even} \pm \text{Odd} = \text{Odd} Even ± Odd = Odd 2 a ± ( 2 b + 1 ) = 2 ( a ± b ) ± 1 2a \pm (2b+1) = 2(a \pm b) \pm 1 2 a ± ( 2 b + 1 ) = 2 ( a ± b ) ± 1 16 + 9 = 25 16 + 9 = 25 16 + 9 = 25

Multiplication Even × Integer = Even \text{Even} \times \text{Integer} = \text{Even} Even × Integer = Even 2 a × k = 2 ( a k ) 2a \times k = 2(ak) 2 a × k = 2 ( ak ) 8 × 7 = 56 8 \times 7 = 56 8 × 7 = 56

Multiplication Odd × Odd = Odd \text{Odd} \times \text{Odd} = \text{Odd} Odd × Odd = Odd ( 2 a + 1 ) ( 2 b + 1 ) = 2 ( 2 a b + a + b ) + 1 (2a+1)(2b+1) = 2(2ab+a+b)+1 ( 2 a + 1 ) ( 2 b + 1 ) = 2 ( 2 ab + a + b ) + 1 9 × 7 = 63 9 \times 7 = 63 9 × 7 = 63

Tip

Parity Invariance in Item Elimination : If an exam question asks for the sum of an odd number of odd integers (for instance, five odd expense vouchers), the resulting total must always be odd . Any multiple-choice options with even values can be crossed out instantly without manual addition.

For a product of nonzero numbers, an even number of negative factors produces a positive result and an odd number produces a negative result. A zero factor makes the product zero. For x > 0 x>0 x > 0 , ( − x ) n (-x)^n ( − x ) n is positive for an even integer exponent and negative for an odd one.

Comprehensive Divisibility Rules (2 through 12)

Divisibility tests are the ultimate weapon for factoring, reducing fractions, and identifying multiples in calculator-free exams:

Divisor Divisibility Criterion Example Verification

2 The final digit is even ( 0 , 2 , 4 , 6 , 8 0, 2, 4, 6, 8 0 , 2 , 4 , 6 , 8 ). 45 , 896 45,896 45 , 896 ends in 6 6 6 (divisible).

3 The sum of all digits is divisible by 3 3 3 . 14 , 631 → 1 + 4 + 6 + 3 + 1 = 15 14,631 \rightarrow 1+4+6+3+1 = 15 14 , 631 → 1 + 4 + 6 + 3 + 1 = 15 ; 15 ÷ 3 = 5 15 \div 3 = 5 15 ÷ 3 = 5 (divisible).

4 The integer formed by the last two digits is divisible by 4 4 4 . 912 , 536 → 36 ÷ 4 = 9 912,536 \rightarrow 36 \div 4 = 9 912 , 536 → 36 ÷ 4 = 9 (divisible).

5 The final digit is either 0 0 0 or 5 5 5 . 78 , 415 78,415 78 , 415 ends in 5 5 5 (divisible).

6 The number satisfies the rules for both 2 2 2 (even) and 3 3 3 (sum of digits divisible by 3). 2 , 784 2,784 2 , 784 : ends in 4 4 4 (even); 2 + 7 + 8 + 4 = 21 2+7+8+4 = 21 2 + 7 + 8 + 4 = 21 ( 21 ÷ 3 = 7 21 \div 3 = 7 21 ÷ 3 = 7 ) → \rightarrow → divisible by 6.

7 Double the last digit and subtract it from the truncated remaining number; the result is divisible by 7 7 7 (including 0 0 0 ). 868 → 86 − ( 2 × 8 ) = 86 − 16 = 70 868 \rightarrow 86 - (2 \times 8) = 86 - 16 = 70 868 → 86 − ( 2 × 8 ) = 86 − 16 = 70 ; 70 ÷ 7 = 10 70 \div 7 = 10 70 ÷ 7 = 10 (divisible).

8 The integer formed by the last three digits is divisible by 8 8 8 . 45 , 128 → 128 ÷ 8 = 16 45,128 \rightarrow 128 \div 8 = 16 45 , 128 → 128 ÷ 8 = 16 (divisible).

9 The sum of all digits is divisible by 9 9 9 . 43 , 722 → 4 + 3 + 7 + 2 + 2 = 18 43,722 \rightarrow 4+3+7+2+2 = 18 43 , 722 → 4 + 3 + 7 + 2 + 2 = 18 ; 18 ÷ 9 = 2 18 \div 9 = 2 18 ÷ 9 = 2 (divisible).

10 The final digit is 0 0 0 . 120 , 490 120,490 120 , 490 ends in 0 0 0 (divisible).

11 The difference between the sum of digits in odd positions and the sum of digits in even positions is a multiple of 11 11 11 (including 0 0 0 ). 918 , 291 918,291 918 , 291 : ( 9 + 8 + 9 ) − ( 1 + 2 + 1 ) = 26 − 4 = 22 (9+8+9) - (1+2+1) = 26 - 4 = 22 ( 9 + 8 + 9 ) − ( 1 + 2 + 1 ) = 26 − 4 = 22 ; 22 ÷ 11 = 2 22 \div 11 = 2 22 ÷ 11 = 2 (divisible).

12 The number satisfies the rules for both 3 3 3 and 4 4 4 (since 3 3 3 and 4 4 4 are coprime). 3 , 516 3,516 3 , 516 : ends in 16 16 16 ( 16 ÷ 4 = 4 16 \div 4 = 4 16 ÷ 4 = 4 ); 3 + 5 + 1 + 6 = 15 3+5+1+6 = 15 3 + 5 + 1 + 6 = 15 ( 15 ÷ 3 = 5 15 \div 3 = 5 15 ÷ 3 = 5 ) → \rightarrow → divisible by 12.

Note

Composite Divisibility via Coprime Factors : To test divisibility by any composite number N = a × b N = a \times b N = a × b , a a a and b b b must be coprime (their greatest common factor must be 1 1 1 ). For example, to test divisibility by 12, use 3 3 3 and 4 4 4 ( GCF ( 3 , 4 ) = 1 \text{GCF}(3, 4) = 1 GCF ( 3 , 4 ) = 1 ), not 2 2 2 and 6 6 6 ( GCF ( 2 , 6 ) = 2 \text{GCF}(2, 6) = 2 GCF ( 2 , 6 ) = 2 ). A number like 18 18 18 is divisible by both 2 2 2 and 6 6 6 , yet 18 18 18 is not divisible by 12 12 12 .

Prime Factorization, GCF, and LCM

The Fundamental Theorem of Arithmetic states that every integer greater than 1 is either a prime itself or can be represented uniquely as a product of prime powers, up to the order of factors: N = p 1 a 1 × p 2 a 2 × ⋯ × p k a k N = p_1^{a_1} \times p_2^{a_2} \times \dots \times p_k^{a_k} N = p 1 a 1 ​ ​ × p 2 a 2 ​ ​ × ⋯ × p k a k ​ ​

Finding the Greatest Common Factor (GCF)

The Greatest Common Factor (GCF) , or Greatest Common Divisor (GCD), is the largest integer that divides each of two or more integers without remainder. To calculate the GCF:

Express each number in prime factorized form.

Identify the common prime factors.

Take each common factor raised to the lowest exponent present in the factorizations.

Finding the Least Common Multiple (LCM)

The Least Common Multiple (LCM) is the smallest positive integer that is divisible by all given numbers. To calculate the LCM:

Express each number in prime factorized form.

Identify all unique prime factors across all numbers.

Take each factor raised to the highest exponent present.

The Fundamental Product Theorem

For any two positive integers a a a and b b b : GCF ( a , b ) × LCM ( a , b ) = a × b \text{GCF}(a, b) \times \text{LCM}(a, b) = a \times b GCF ( a , b ) × LCM ( a , b ) = a × b

This identity allows you to compute the LCM instantly once the GCF is known: LCM ( a , b ) = a × b GCF ( a , b ) \text{LCM}(a, b) = \frac{a \times b}{\text{GCF}(a, b)} LCM ( a , b ) = GCF ( a , b ) a × b ​ .

Loading diagram...

Order of Operations (PEMDAS/BODMAS) Traps

The standard hierarchy of operations must be applied rigorously:

P / B : Parentheses and Brackets (evaluate from innermost to outermost: ( ) → [ ] → { } ( ) \rightarrow [ ] \rightarrow \{ \} ( ) → [ ] → { } ).

E / O : Exponents and Roots / Orders.

MD : Multiplication and Division — evaluated strictly from left to right in the order they appear.

AS : Addition and Subtraction — evaluated strictly from left to right in the order they appear.

Warning

The Multiplication-Division Precedence Trap : The most pervasive error in civil service arithmetic is treating multiplication as having higher precedence than division because the letter 'M' precedes 'D' in PEMDAS. In truth, multiplication and division possess equal precedence . Consider the expression: 48 ÷ 6 × 2 48 \div 6 \times 2 48 ÷ 6 × 2

Correct : Evaluate left to right: 48 ÷ 6 = 8 48 \div 6 = 8 48 ÷ 6 = 8 , then 8 × 2 = 16 8 \times 2 = 16 8 × 2 = 16 .

Trap : Evaluating 6 × 2 = 12 6 \times 2 = 12 6 × 2 = 12 first produces 48 ÷ 12 = 4 48 \div 12 = 4 48 ÷ 12 = 4 , which is completely incorrect.

High-Speed Mental Math Shortcuts for Timed Testing

When competing against the clock, manual column multiplication and long division consume excessive time. Implement these standard shortcuts:

1. Multiplying by 5, 25, and 50

Because humans calculate in base 10, shift calculations to powers of 10:

Multiply by 5 : Multiply by 10 10 10 and divide by 2 2 2 : 348 × 5 = 3480 2 = 1740 348 \times 5 = \frac{3480}{2} = 1740 348 × 5 = 2 3480 ​ = 1740

Multiply by 25 : Multiply by 100 100 100 and divide by 4 4 4 : 64 × 25 = 6400 4 = 1600 64 \times 25 = \frac{6400}{4} = 1600 64 × 25 = 4 6400 ​ = 1600

Multiply by 50 : Multiply by 100 100 100 and divide by 2 2 2 : 96 × 50 = 9600 2 = 4800 96 \times 50 = \frac{9600}{2} = 4800 96 × 50 = 2 9600 ​ = 4800

2. Squaring Two-Digit Numbers Ending in 5

Any number ending in 5 can be represented as 10 n + 5 10n + 5 10 n + 5 . Its square is given by: ( 10 n + 5 ) 2 = 100 n ( n + 1 ) + 25 (10n + 5)^2 = 100n(n + 1) + 25 ( 10 n + 5 ) 2 = 100 n ( n + 1 ) + 25

To compute ( 75 ) 2 (75)^2 ( 75 ) 2 : take the tens digit 7 7 7 , multiply by its successor 8 8 8 ( 7 × 8 = 56 7 \times 8 = 56 7 × 8 = 56 ), and append 25 25 25 . Thus, 75 2 = 5625 75^2 = 5625 7 5 2 = 5625 .

3. Distributive Factoring (Decomposition)

Break multi-digit products into round benchmark components: 42 × 18 = 42 × ( 20 − 2 ) = 840 − 84 = 756 42 \times 18 = 42 \times (20 - 2) = 840 - 84 = 756 42 × 18 = 42 × ( 20 − 2 ) = 840 − 84 = 756 65 × 103 = 65 × ( 100 + 3 ) = 6500 + 195 = 6695 65 \times 103 = 65 \times (100 + 3) = 6500 + 195 = 6695 65 × 103 = 65 × ( 100 + 3 ) = 6500 + 195 = 6695

4. Digit-sum checking (casting out nines)

Compare both sides modulo 9: sum the digits of each operand and reduce the proposed result in the same way. For multiplication, multiply the residues and reduce the product again. A mismatch detects an error; a match does not prove correctness because errors differing by a multiple of 9 can pass. Check units, magnitude, and the original operation as well.