Study guide
4.1 Arithmetic Operations, Number Properties & Order of Operations
Ghana Armed Forces Officer Cadet Written Examination Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Orientation & GAF Officer Selection Architecture
1.1 Ghana Military Academy (GMA) Cadet Selection Overview & Regulations 1.2 Selection Phases — Screening, Aptitude Test, BFT, OLT, Medical & Final Interview 1.3 Written Examination Strategy, Competitive Scoring & Test-Taking Tactics
2 Chapter 2: Verbal Reasoning — Comprehension & Text Analysis
2.1 Military & Strategic Reading Comprehension Strategies 2.2 Drawing Inferences, Identifying Author Intent & Central Themes 2.3 Critical Text Evaluation & Logical Paragraph Coherence
3 Chapter 3: Verbal Reasoning — Grammar, Vocabulary & Usage
3.1 Lexicon Mastery — High-Frequency Vocabulary, Antonyms & Synonyms 3.2 English Grammar, Syntax, Subject-Verb Agreement & Tense Consistency 3.3 Verbal Analogies, Idiomatic Expressions & Sentence Correction
4 Chapter 4: Quantitative Aptitude — Arithmetic & Business Math
4.1 Arithmetic Operations, Number Properties & Order of Operations 4.2 Percentages, Profit and Loss, Simple and Compound Interest 4.3 Ratios, Proportions, Rates, Work and Time Problems
5 Chapter 5: Quantitative Aptitude — Algebra & Word Problems
5.1 Linear Equations, Inequalities & Simultaneous Systems 5.2 Quadratic Equations, Polynomials & Algebraic Factoring 5.3 Mathematical Word Problems & Quantitative Formulation
6 Chapter 6: Quantitative Aptitude — Geometry, Mensuration & Data
6.1 Geometric Principles — Angles, Lines, Triangles & Polygons 6.2 Mensuration — Perimeter, Area, Surface Area & Volume 6.3 Basic Probability, Statistics & Data Interpretation
7 Chapter 7: Logical Reasoning — Patterns, Sequences & Ciphers
7.1 Number, Letter & Alphanumeric Series 7.2 Coding, Decoding & Substitution Ciphers 7.3 Diagrammatic, Abstract & Matrix Pattern Recognition
8 Chapter 8: Logical Reasoning — Analytical Deduction & Arrangements
8.1 Formal Syllogisms, Venn Diagrams & Deductive Logic 8.2 Direction Sense, Distance Tracking & Cardinal Navigation 8.3 Linear and Circular Seating Arrangements & Blood Relations Logic
9 Chapter 9: General Knowledge — Ghanaian History & Governance
9.1 Pre-Colonial, Colonial Era & Ghana's Independence (1957) 9.2 The Republics, Constitutional Transitions & Key National Leaders 9.3 The 1992 Constitution, Arms of Government & Public Institutions
10 Chapter 10: General Knowledge — Geography, Defense & Security Architecture
10.1 Geography of Ghana — 16 Regions, Capitals, Physical Features & Resources 10.2 Ghana Armed Forces Structure — Army, Navy, Air Force, Command & Ranks 10.3 National Security, Peacekeeping Operations (UN/AU/ECOWAS) & Regional Security
4.1 Arithmetic Operations, Number Properties & Order of Operations
Key Takeaways Explain This Topic AI
The Fundamental Theorem of Arithmetic establishes that every integer greater than 1 is either prime or uniquely factorable into prime components, underpinning all LCM and HCF derivations.
Divisibility tests for composite divisors require testing mutually coprime factors; for example, divisibility by 12 demands simultaneous satisfaction of the divisibility tests for 3 and 4.
The Euclidean algorithm computes the greatest common divisor via repeated division remainders, providing a rapid logarithmic alternative to prime factorization for large numbers.
Under strict BODMAS/PEMDAS hierarchies, division and multiplication share equal operational priority and must be executed strictly from left to right, as do addition and subtraction.
Last updated: October 2026
Arithmetic Operations, Number Properties & Order of Operations
Military command demands rapid, error-free quantitative estimation and precise numerical calculation. Whether computing ammunition consumption rates, establishing ballistic mortar ranges, rationing logistical fuel reserves, or allocating manpower across tactical operational sectors, an officer must possess absolute fluency in foundational arithmetic. On the Ghana Armed Forces (GAF) Officer Cadet Written Examination, the quantitative aptitude section assesses speed, analytical rigor, and conceptual depth under strict time constraints.
Mastery begins with a rigorous comprehension of number properties, algebraic structures, divisibility mechanics, and order of operations. Candidates who rely on slow, manual long division or ambiguous operational hierarchies inevitably suffer from cognitive fatigue and test pacing failures.
Classification of Numbers & Structural Taxonomy
The real number system, denoted by R \mathbb{R} R , forms the operational space for military quantitative aptitude. Candidates must recognize the formal hierarchy and boundaries between distinct numerical classifications. REAL NUMBERS (R)
- |
- +--------------------------+--------------------------+
- | |
- RATIONAL NUMBERS (Q) IRRATIONAL NUMBERS
(Terminating & Recurring Decimals) (Non-terminating, Non-recurring:
- | sqrt(2), sqrt(3), pi, e)
- +--------------------------+
- | |
- FRACTIONS INTEGERS (Z)
- (Proper, Improper, Mixed) (..., -2, -1, 0, 1, 2, ...)
- |
- +--------------------------+
- | |
- NEGATIVE INTEGERS WHOLE NUMBERS (W)
- (-1, -2, -3, ...) (0, 1, 2, 3, ...)
- |
- +--------------+--------------+
- | |
- ZERO (0) NATURAL NUMBERS (N)
- (1, 2, 3, 4, ...)
- |
- +-------------+-------------+
- | | |
- PRIME COMPOSITE UNIT
- (2,3,5..) (4,6,8,9..) (1)
- Formal Definitions and Operational Distinctions
Classification Mathematical Notation & Set Definition Distinguishing Properties Military Operational Exemplar
Natural Numbers N = { 1 , 2 , 3 , 4 , 5 , … } \mathbb{N} = \{1, 2, 3, 4, 5, \dots\} N = { 1 , 2 , 3 , 4 , 5 , … } Positive counting integers; excludes zero and negative values. Headcount of active frontline sentries assigned to defensive trenches.
Whole Numbers W = { 0 , 1 , 2 , 3 , 4 , … } \mathbb{W} = \{0, 1, 2, 3, 4, \dots\} W = { 0 , 1 , 2 , 3 , 4 , … } Natural numbers augmented with zero ( 0 0 0 ). Count of unexploded ordnance discovered in a cleared staging corridor.
Integers Z = { … , − 3 , − 2 , − 1 , 0 , 1 , 2 , 3 , … } \mathbb{Z} = \{\dots, -3, -2, -1, 0, 1, 2, 3, \dots\} Z = { … , − 3 , − 2 , − 1 , 0 , 1 , 2 , 3 , … } Complete set of positive and negative whole numbers without fractional components. Elevation differentials relative to mean sea level during topographic route planning.
Rational Numbers Q = { p q | p , q ∈ Z , q ≠ 0 } \mathbb{Q} = \left\{\frac{p}{q} \;\middle\vert\; p, q \in \mathbb{Z}, q \neq 0\right\} Q = { q p p , q ∈ Z , q = 0 } Any number expressible as a ratio of two integers; yields terminating or repeating decimals. Rations remaining per soldier: 7 4 = 1.75 \frac{7}{4} = 1.75 4 7 = 1.75 field packs.
Irrational Numbers R ∖ Q \mathbb{R} \setminus \mathbb{Q} R ∖ Q Real numbers that cannot be expressed as p q \frac{p}{q} q p ; decimals are non-terminating and non-repeating. Line-of-sight distance across a 1 km × 1 km 1\text{ km} \times 1\text{ km} 1 km × 1 km grid square: 2 ≈ 1.4142 km \sqrt{2} \approx 1.4142\text{ km} 2 ≈ 1.4142 km .
Real Numbers R \mathbb{R} R The union of all rational and irrational numbers representing points along the continuous number line. Total measured fuel volume in forward depot tanks ( 4250.65 liters 4250.65\text{ liters} 4250.65 liters ).
Properties of Prime, Composite, and Coprime Numbers
Prime Numbers : A natural number p > 1 p > 1 p > 1 that possesses exactly two distinct positive divisors: 1 1 1 and p p p . The first ten primes are 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 2, 3, 5, 7, 11, 13, 17, 19, 23, 29 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 . Note that 2 2 2 is the unique even prime number and the smallest prime.
Composite Numbers : A natural number n > 1 n > 1 n > 1 that possesses more than two distinct positive divisors (e.g., 4 , 6 , 8 , 9 , 10 , 12 4, 6, 8, 9, 10, 12 4 , 6 , 8 , 9 , 10 , 12 ).
The Unit ( 1 1 1 ) : The integer 1 1 1 has only one positive divisor ( 1 1 1 itself). Therefore, 1 1 1 is strictly neither prime nor composite.
Coprime (Relatively Prime) Integers : Two integers a a a and b b b are coprime if and only if their greatest common divisor is 1 1 1 , written as gcd ( a , b ) = 1 \gcd(a, b) = 1 g cd ( a , b ) = 1 . For example, 8 8 8 and 15 15 15 are both composite, yet gcd ( 8 , 15 ) = 1 \gcd(8, 15) = 1 g cd ( 8 , 15 ) = 1 , making them coprime.
The Prime Verification Test : To determine whether an integer N N N is prime, identify the largest integer k k k such that k ≤ N k \le \sqrt{N} k ≤ N . Test N N N for divisibility only by the prime numbers less than or equal to k k k . If no prime p ≤ N p \le \sqrt{N} p ≤ N divides N N N , then N N N is unconditionally prime.
Example : Test whether 173 173 173 is prime. Since 173 ≈ 13.15 \sqrt{173} \approx 13.15 173 ≈ 13.15 , test primes p ≤ 13 p \le 13 p ≤ 13 : { 2 , 3 , 5 , 7 , 11 , 13 } \{2, 3, 5, 7, 11, 13\} { 2 , 3 , 5 , 7 , 11 , 13 } . None divide 173 173 173 evenly ( 173 = 7 × 24 + 5 = 11 × 15 + 8 = 13 × 13 + 4 173 = 7 \times 24 + 5 = 11 \times 15 + 8 = 13 \times 13 + 4 173 = 7 × 24 + 5 = 11 × 15 + 8 = 13 × 13 + 4 ). Thus, 173 173 173 is prime.
Comprehensive Divisibility Rules & Modular Verification
Divisibility rules allow an officer to instantly verify supply counts, crate packaging, and modular groupings without executing tedious paper-and-pencil long division.
Divisibility Protocols (2 Through 12)
Divisor Mathematical Condition / Rule Verification Algorithm & Operational Demonstration
2 The units digit is even ( 0 , 2 , 4 , 6 , 8 0, 2, 4, 6, 8 0 , 2 , 4 , 6 , 8 ). Examine 4 , 798 4,798 4 , 798 : Units digit is 8 8 8 (even) ⟹ \implies ⟹ Divisible by 2 2 2 .
3 The sum of all digits is a multiple of 3 3 3 . Examine 58 , 212 58,212 58 , 212 : 5 + 8 + 2 + 1 + 2 = 18 5 + 8 + 2 + 1 + 2 = 18 5 + 8 + 2 + 1 + 2 = 18 . Since 18 ÷ 3 = 6 18 \div 3 = 6 18 ÷ 3 = 6 , 58 , 212 58,212 58 , 212 is divisible by 3 3 3 .
4 The number formed by the last two digits is divisible by 4 4 4 . Examine 17 , 564 17,564 17 , 564 : Last two digits are 64 64 64 . Since 64 ÷ 4 = 16 64 \div 4 = 16 64 ÷ 4 = 16 , 17 , 564 17,564 17 , 564 is divisible by 4 4 4 .
5 The units digit is either 0 0 0 or 5 5 5 . Examine 92 , 345 92,345 92 , 345 : Units digit is 5 5 5 ⟹ \implies ⟹ Divisible by 5 5 5 .
6 The number is simultaneously divisible by both 2 2 2 and 3 3 3 . Examine 7 , 422 7,422 7 , 422 : Units digit is 2 2 2 (even ⟹ \implies ⟹ div by 2 2 2 ). Sum of digits: 7 + 4 + 2 + 2 = 15 7 + 4 + 2 + 2 = 15 7 + 4 + 2 + 2 = 15 (div by 3 3 3 ). Hence, divisible by 6 6 6 .
7 Truncate the last digit, double it, and subtract from the remaining truncated number. Repeat if necessary; the result must be divisible by 7 7 7 or equal 0 0 0 . Examine 2 , 429 2,429 2 , 429 : 242 − 2 ( 9 ) = 242 − 18 = 224 242 - 2(9) = 242 - 18 = 224 242 − 2 ( 9 ) = 242 − 18 = 224 . Repeat: 22 − 2 ( 4 ) = 22 − 8 = 14 22 - 2(4) = 22 - 8 = 14 22 − 2 ( 4 ) = 22 − 8 = 14 . Since 14 = 7 × 2 14 = 7 \times 2 14 = 7 × 2 , 2 , 429 2,429 2 , 429 is divisible by 7 7 7 .
8 The number formed by the last three digits is divisible by 8 8 8 . Examine 54 , 168 54,168 54 , 168 : Last three digits are 168 168 168 . Since 168 ÷ 8 = 21 168 \div 8 = 21 168 ÷ 8 = 21 , 54 , 168 54,168 54 , 168 is divisible by 8 8 8 . (Shortcut: If hundreds digit is odd, check if last two digits + 4 + 4 + 4 is div by 8 8 8 : 68 + 4 = 72 68 + 4 = 72 68 + 4 = 72 , div by 8 8 8 ).
9 The sum of all digits is a multiple of 9 9 9 . Examine 784 , 521 784,521 784 , 521 : 7 + 8 + 4 + 5 + 2 + 1 = 27 7 + 8 + 4 + 5 + 2 + 1 = 27 7 + 8 + 4 + 5 + 2 + 1 = 27 . Since 27 ÷ 9 = 3 27 \div 9 = 3 27 ÷ 9 = 3 , 784 , 521 784,521 784 , 521 is divisible by 9 9 9 .
10 The units digit is 0 0 0 . Examine 83 , 490 83,490 83 , 490 : Units digit is 0 0 0 ⟹ \implies ⟹ Divisible by 10 10 10 .
11 The alternating sum of digits (sum of odd-position digits minus sum of even-position digits) must equal 0 0 0 or a multiple of 11 11 11 . Examine 918 , 390 918,390 918 , 390 : Odd positions: 0 + 3 + 1 = 4 0 + 3 + 1 = 4 0 + 3 + 1 = 4 . Even positions: 9 + 8 + 9 = 26 9 + 8 + 9 = 26 9 + 8 + 9 = 26 . Difference: 26 − 4 = 22 26 - 4 = 22 26 − 4 = 22 . Since 22 = 11 × 2 22 = 11 \times 2 22 = 11 × 2 , 918 , 390 918,390 918 , 390 is divisible by 11 11 11 .
12 The number is simultaneously divisible by both 3 3 3 and 4 4 4 (since gcd ( 3 , 4 ) = 1 \gcd(3, 4) = 1 g cd ( 3 , 4 ) = 1 ). Examine 3 , 456 3,456 3 , 456 : Last two digits are 56 56 56 ( 56 ÷ 4 = 14 ⟹ 56 \div 4 = 14 \implies 56 ÷ 4 = 14 ⟹ div by 4 4 4 ). Sum of digits: 3 + 4 + 5 + 6 = 18 3 + 4 + 5 + 6 = 18 3 + 4 + 5 + 6 = 18 ( 18 ÷ 3 = 6 ⟹ 18 \div 3 = 6 \implies 18 ÷ 3 = 6 ⟹ div by 3 3 3 ). Hence, divisible by 12 12 12 .
The Coprime Factor Theorem for Composite Divisors
To test divisibility by any composite divisor C C C , express C C C as the product of two coprime integers a a a and b b b such that C = a × b C = a \times b C = a × b and gcd ( a , b ) = 1 \gcd(a, b) = 1 g cd ( a , b ) = 1 . The number N N N is divisible by C C C if and only if it is divisible by both a a a and b b b .
Divisibility by 15 15 15 : Test divisibility by 3 3 3 and 5 5 5 (since gcd ( 3 , 5 ) = 1 \gcd(3, 5) = 1 g cd ( 3 , 5 ) = 1 ).
Divisibility by 18 18 18 : Test divisibility by 2 2 2 and 9 9 9 (since gcd ( 2 , 9 ) = 1 \gcd(2, 9) = 1 g cd ( 2 , 9 ) = 1 ).
Divisibility by 72 72 72 : Test divisibility by 8 8 8 and 9 9 9 (since gcd ( 8 , 9 ) = 1 \gcd(8, 9) = 1 g cd ( 8 , 9 ) = 1 ).
Warning : Do not use non-coprime factors! Testing divisibility by 2 2 2 and 6 6 6 does NOT prove divisibility by 12 12 12 , because 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 .
LCM, HCF (GCD), and the Euclidean Algorithm
Logistics planning frequently requires finding the greatest common unit size to pack heterogeneous assets (Highest Common Factor / HCF) or calculating the synchronization cycle of independent periodic resupply convoys (Lowest Common Multiple / LCM).
1. Prime Factorization Method
Let two positive integers be resolved into their canonical prime factorizations: a = p 1 e 1 p 2 e 2 ⋯ p k e k , b = p 1 f 1 p 2 f 2 ⋯ p k f k a = p_1^{e_1} p_2^{e_2} \cdots p_k^{e_k}, \quad b = p_1^{f_1} p_2^{f_2} \cdots p_k^{f_k} a = p 1 e 1 p 2 e 2 ⋯ p k e k , b = p 1 f 1 p 2 f 2 ⋯ p k f k
Highest Common Factor (HCF / GCD) : Take the lowest exponent for every common prime factor: HCF ( a , b ) = p 1 min ( e 1 , f 1 ) p 2 min ( e 2 , f 2 ) ⋯ p k min ( e k , f k ) \operatorname{HCF}(a, b) = p_1^{\min(e_1, f_1)} p_2^{\min(e_2, f_2)} \cdots p_k^{\min(e_k, f_k)} HCF ( a , b ) = p 1 m i n ( e 1 , f 1 ) p 2 m i n ( e 2 , f 2 ) ⋯ p k m i n ( e k , f k )
Lowest Common Multiple (LCM) : Take the highest exponent across all prime factors present in either number: LCM ( a , b ) = p 1 max ( e 1 , f 1 ) p 2 max ( e 2 , f 2 ) ⋯ p k max ( e k , f k ) \operatorname{LCM}(a, b) = p_1^{\max(e_1, f_1)} p_2^{\max(e_2, f_2)} \cdots p_k^{\max(e_k, f_k)} LCM ( a , b ) = p 1 m a x ( e 1 , f 1 ) p 2 m a x ( e 2 , f 2 ) ⋯ p k m a x ( e k , f k )
2. The Fundamental Product Invariant
For any two positive integers a a a and b b b , the product of their HCF and LCM is identically equal to the product of the numbers themselves: HCF ( a , b ) × LCM ( a , b ) = a × b \operatorname{HCF}(a, b) \times \operatorname{LCM}(a, b) = a \times b HCF ( a , b ) × LCM ( a , b ) = a × b
This identity provides a rapid verification tool and allows calculating the LCM directly once the HCF is known: LCM ( a , b ) = a × b HCF ( a , b ) \operatorname{LCM}(a, b) = \frac{a \times b}{\operatorname{HCF}(a, b)} LCM ( a , b ) = HCF ( a , b ) a × b .
3. The Euclidean Algorithm for Rapid HCF Computation
When dealing with large integers (e.g., ammunition batches of 1 , 848 1,848 1 , 848 and 1 , 155 1,155 1 , 155 ), prime factorization becomes slow and prone to arithmetic blunders. The Euclidean algorithm operates on the principle that the greatest common divisor of two integers a a a and b b b ( a > b a > b a > b ) also divides their remainder r = a ( m o d b ) r = a \pmod b r = a ( mod b ) : GCD ( a , b ) = GCD ( b , a ( m o d b ) ) \operatorname{GCD}(a, b) = \operatorname{GCD}(b, a \pmod b) GCD ( a , b ) = GCD ( b , a ( mod b ))
Worked Example: Calculating GCD ( 1848 , 1155 ) \operatorname{GCD}(1848, 1155) GCD ( 1848 , 1155 )
Step 1 : Divide 1848 1848 1848 by 1155 1155 1155 : 1848 = 1155 × 1 + 693 1848 = 1155 \times 1 + 693 1848 = 1155 × 1 + 693
Step 2 : Divide the previous divisor ( 1155 1155 1155 ) by the remainder ( 693 693 693 ): 1155 = 693 × 1 + 462 1155 = 693 \times 1 + 462 1155 = 693 × 1 + 462
- Step 3 : Divide 693 693 693 by 462 462 462 : 693 = 462 × 1 + 231 693 = 462 \times 1 + 231 693 = 462 × 1 + 231
- Step 4 : Divide 462 462 462 by 231 231 231 : 462 = 231 × 2 + 0 462 = 231 \times 2 + 0 462 = 231 × 2 + 0
Because the remainder has reached 0 0 0 , the final non-zero divisor is the greatest common factor: HCF ( 1848 , 1155 ) = 231 \operatorname{HCF}(1848, 1155) = 231 HCF ( 1848 , 1155 ) = 231
To find their LCM using the product invariant: LCM ( 1848 , 1155 ) = 1848 × 1155 231 = 1848 × 5 = 9 , 240 \operatorname{LCM}(1848, 1155) = \frac{1848 \times 1155}{231} = 1848 \times 5 = 9,240 LCM ( 1848 , 1155 ) = 231 1848 × 1155 = 1848 × 5 = 9 , 240
4. Operational Application: Ammunition Packaging
Suppose a quartermaster at Burma Camp receives three consignments of rifle cartridges: 315 315 315 rounds of 7.62 mm 7.62\text{ mm} 7.62 mm , 420 420 420 rounds of 5.56 mm 5.56\text{ mm} 5.56 mm , and 1 , 155 1,155 1 , 155 rounds of 9 mm 9\text{ mm} 9 mm . The ammunition must be packed into identical crates such that each crate contains the exact same composition of calibers with zero ammunition remaining unpacked.
The maximum number of identical crates possible is given by HCF ( 315 , 420 , 1155 ) \operatorname{HCF}(315, 420, 1155) HCF ( 315 , 420 , 1155 ) :
- 315 = 3 2 × 5 × 7 315 = 3^2 \times 5 \times 7 315 = 3 2 × 5 × 7
- 420 = 2 2 × 3 × 5 × 7 420 = 2^2 \times 3 \times 5 \times 7 420 = 2 2 × 3 × 5 × 7
- 1155 = 3 × 5 × 7 × 11 1155 = 3 \times 5 \times 7 \times 11 1155 = 3 × 5 × 7 × 11
- Common prime factors: 3 1 , 5 1 , 7 1 3^1, 5^1, 7^1 3 1 , 5 1 , 7 1
HCF = 3 × 5 × 7 = 105 \operatorname{HCF} = 3 \times 5 \times 7 = 105 HCF = 3 × 5 × 7 = 105 crates.
Each crate contains: 315 105 = 3 \frac{315}{105} = 3 105 315 = 3 rounds ( 7.62 mm 7.62\text{ mm} 7.62 mm ), 420 105 = 4 \frac{420}{105} = 4 105 420 = 4 rounds ( 5.56 mm 5.56\text{ mm} 5.56 mm ), and 1155 105 = 11 \frac{1155}{105} = 11 105 1155 = 11 rounds ( 9 mm 9\text{ mm} 9 mm ).
BODMAS / PEMDAS Hierarchies & Nested Traps
The order of operations defines the unambiguous sequence in which mathematical expressions must be evaluated. In Ghanaian schools, as across the Commonwealth, the BODMAS acronym is standard (equivalent to the American PEMDAS ). B - Brackets (Vinculum, Parentheses, Braces, Square Brackets)
- O - Orders (Powers, Indices, Roots)
- D - Division [Equal Priority: Executed Strictly Left-to-Right]
- M - Multiplication [Equal Priority: Executed Strictly Left-to-Right]
- A - Addition [Equal Priority: Executed Strictly Left-to-Right]
- S - Subtraction [Equal Priority: Executed Strictly Left-to-Right]
- The Left-to-Right Precedence Rule
A pervasive error on officer aptitude tests is treating Division as strictly superior to Multiplication, or Addition as strictly superior to Subtraction. In formal mathematics:
Division and Multiplication share identical operational priority. When both appear in a chain, evaluate them strictly in order from left to right.
Example : 24 ÷ 6 × 2 24 \div 6 \times 2 24 ÷ 6 × 2
Incorrect (premature multiplication) : 24 ÷ ( 6 × 2 ) = 24 ÷ 12 = 2 24 \div (6 \times 2) = 24 \div 12 = 2 24 ÷ ( 6 × 2 ) = 24 ÷ 12 = 2 .
Correct (left-to-right evaluation) : ( 24 ÷ 6 ) × 2 = 4 × 2 = 8 (24 \div 6) \times 2 = 4 \times 2 = 8 ( 24 ÷ 6 ) × 2 = 4 × 2 = 8 .
Addition and Subtraction share identical operational priority. Evaluate strictly from left to right.
Example : 15 − 8 + 4 15 - 8 + 4 15 − 8 + 4
Incorrect (premature addition) : 15 − ( 8 + 4 ) = 15 − 12 = 3 15 - (8 + 4) = 15 - 12 = 3 15 − ( 8 + 4 ) = 15 − 12 = 3 .
Correct (left-to-right evaluation) : ( 15 − 8 ) + 4 = 7 + 4 = 11 (15 - 8) + 4 = 7 + 4 = 11 ( 15 − 8 ) + 4 = 7 + 4 = 11 .
Hierarchy of Parenthetical Nesting
When multiple grouping symbols appear, evaluate from the innermost layer to the outermost layer in this sequence:
- Vinculum (Bar / Overline) : a − b ‾ \overline{a - b} a − b (binds terms tighter than standard parentheses)
- Parentheses (Round Brackets) : ( … ) ( \dots ) ( … )
- Braces (Curly Brackets) : { … } \{ \dots \} { … }
- Square Brackets : [ … ] [ \dots ] [ … ]
- Negative Sign Distribution Trap
A negative sign preceding a parenthetical expression distributes across every internal term, reversing its sign: − [ a − b + c ] = − a + b − c -[a - b + c] = -a + b - c − [ a − b + c ] = − a + b − c
Comprehensive Worked BODMAS Problem
Evaluate the following complex expression: E = 72 ÷ 8 × 3 − [ 24 − { 16 − 3 × ( 10 − 7 − 3 ‾ ) } ] E = 72 \div 8 \times 3 - [24 - \{16 - 3 \times (10 - \overline{7 - 3})\}] E = 72 ÷ 8 × 3 − [ 24 − { 16 − 3 × ( 10 − 7 − 3 )}]
Step 1 (Resolve the Vinculum) : The bar rests over 7 − 3 7 - 3 7 − 3 : 7 − 3 ‾ = 4 \overline{7 - 3} = 4 7 − 3 = 4 Expression becomes: 72 ÷ 8 × 3 − [ 24 − { 16 − 3 × ( 10 − 4 ) } ] 72 \div 8 \times 3 - [24 - \{16 - 3 \times (10 - 4)\}] 72 ÷ 8 × 3 − [ 24 − { 16 − 3 × ( 10 − 4 )}]
Step 2 (Resolve Parentheses) : Evaluate 10 − 4 10 - 4 10 − 4 : 10 − 4 = 6 10 - 4 = 6 10 − 4 = 6 Expression becomes: 72 ÷ 8 × 3 − [ 24 − { 16 − 3 × 6 } ] 72 \div 8 \times 3 - [24 - \{16 - 3 \times 6\}] 72 ÷ 8 × 3 − [ 24 − { 16 − 3 × 6 }]
Step 3 (Resolve Multiplication inside Braces) : Multiply 3 × 6 3 \times 6 3 × 6 : 3 × 6 = 18 3 \times 6 = 18 3 × 6 = 18 Expression becomes: 72 ÷ 8 × 3 − [ 24 − { 16 − 18 } ] 72 \div 8 \times 3 - [24 - \{16 - 18\}] 72 ÷ 8 × 3 − [ 24 − { 16 − 18 }]
Step 4 (Resolve Braces) : Evaluate 16 − 18 16 - 18 16 − 18 : 16 − 18 = − 2 16 - 18 = -2 16 − 18 = − 2 Expression becomes: 72 ÷ 8 × 3 − [ 24 − ( − 2 ) ] 72 \div 8 \times 3 - [24 - (-2)] 72 ÷ 8 × 3 − [ 24 − ( − 2 )]
Step 5 (Resolve Square Brackets) : Distribute the negative sign: 24 − ( − 2 ) = 24 + 2 = 26 24 - (-2) = 24 + 2 = 26 24 − ( − 2 ) = 24 + 2 = 26 : [ 24 − ( − 2 ) ] = 26 [24 - (-2)] = 26 [ 24 − ( − 2 )] = 26 Expression becomes: 72 ÷ 8 × 3 − 26 72 \div 8 \times 3 - 26 72 ÷ 8 × 3 − 26
Step 6 (Resolve Division and Multiplication Left-to-Right) : 72 ÷ 8 = 9 , 9 × 3 = 27 72 \div 8 = 9, \quad 9 \times 3 = 27 72 ÷ 8 = 9 , 9 × 3 = 27
Step 7 (Final Subtraction) : 27 − 26 = 1 27 - 26 = 1 27 − 26 = 1
The exact simplified value is 1 1 1 .
- Fractions, Decimals & Mental Math Heuristics
- 1. Terminating vs. Recurring Decimals
A rational fraction p q \frac{p}{q} q p in irreducible form (where gcd ( p , q ) = 1 \gcd(p, q) = 1 g cd ( p , q ) = 1 ) converts to a terminating decimal if and only if the prime factorization of its denominator q q q contains no prime factors other than 2 2 2 and/or 5 5 5 ( q = 2 m × 5 n q = 2^m \times 5^n q = 2 m × 5 n ). If q q q contains any prime factor other than 2 2 2 or 5 5 5 (such as 3 , 7 , 11 , 13 3, 7, 11, 13 3 , 7 , 11 , 13 ), the fraction generates an infinite repeating (recurring) decimal .
7 40 = 7 2 3 × 5 1 ⟹ \frac{7}{40} = \frac{7}{2^3 \times 5^1} \implies 40 7 = 2 3 × 5 1 7 ⟹ Terminates ( 0.175 0.175 0.175 ).
5 24 = 5 2 3 × 3 1 ⟹ \frac{5}{24} = \frac{5}{2^3 \times 3^1} \implies 24 5 = 2 3 × 3 1 5 ⟹ Recurs indefinitely ( 0.208333 … 0.208333\dots 0.208333 … ).
2. Converting Repeating Decimals to Fractions
Pure Recurring Decimals : All digits after the decimal point repeat. 0. d 1 d 2 … d k ‾ = d 1 d 2 … d k 99 … 9 ⏟ k nines 0.\overline{d_1 d_2 \dots d_k} = \frac{d_1 d_2 \dots d_k}{\underbrace{99\dots9}_{k \text{ nines}}} 0. d 1 d 2 … d k = k nines 99 … 9 d 1 d 2 … d k Example : 0. 45 ‾ = 45 99 = 5 11 0.\overline{45} = \frac{45}{99} = \frac{5}{11} 0. 45 = 99 45 = 11 5 .
Mixed Recurring Decimals : Some non-repeating digits precede the repeating block. 0. a 1 a 2 … a m d 1 d 2 … d k ‾ = ( Entire Number up to end of first period ) − ( Non-repeating Part ) 99 … 9 ⏟ k nines 00 … 0 ⏟ m zeros 0.a_1 a_2 \dots a_m \overline{d_1 d_2 \dots d_k} = \frac{(\text{Entire Number up to end of first period}) - (\text{Non-repeating Part})}{\underbrace{99\dots9}_{k \text{ nines}} \underbrace{00\dots0}_{m \text{ zeros}}} 0. a 1 a 2 … a m d 1 d 2 … d k = k nines 99 … 9 m zeros 00 … 0 ( Entire Number up to end of first period ) − ( Non-repeating Part ) Example : Convert 0.23 6 ‾ 0.23\overline{6} 0.23 6 to an irreducible fraction: x = 0.23666 ⋯ ⟹ 100 x = 23.666 … , 1000 x = 236.666 … x = 0.23666\dots \implies 100x = 23.666\dots, \quad 1000x = 236.666\dots x = 0.23666 ⋯ ⟹ 100 x = 23.666 … , 1000 x = 236.666 … 1000 x − 100 x = 236 − 23 ⟹ 900 x = 213 1000x - 100x = 236 - 23 \implies 900x = 213 1000 x − 100 x = 236 − 23 ⟹ 900 x = 213 x = 213 900 = 71 300 x = \frac{213}{900} = \frac{71}{300} x = 900 213 = 300 71
3. Rapid Mental Math Shortcuts & Elimination Heuristics
Units Digit Periodicity of Powers : In multiple-choice questions involving large exponents, compute only the cycle of the units digit modulo 4 4 4 :
Digits { 0 , 1 , 5 , 6 } \{0, 1, 5, 6\} { 0 , 1 , 5 , 6 } always repeat every power (period 1 1 1 ): 6 n 6^n 6 n always ends in 6 6 6 .
Digits { 4 , 9 } \{4, 9\} { 4 , 9 } alternate in cycles of 2 2 2 : 4 1 = 4 , 4 2 = 16 , 4 3 = 64 4^1 = 4, 4^2 = 16, 4^3 = 64 4 1 = 4 , 4 2 = 16 , 4 3 = 64 (odd powers end in 4 4 4 , even powers end in 6 6 6 ).
Digits { 2 , 3 , 7 , 8 } \{2, 3, 7, 8\} { 2 , 3 , 7 , 8 } cycle through 4 4 4 values:
2 1 = 2 , 2 2 = 4 , 2 3 = 8 , 2 4 = 16 ⟹ 2^1=2, 2^2=4, 2^3=8, 2^4=16 \implies 2 1 = 2 , 2 2 = 4 , 2 3 = 8 , 2 4 = 16 ⟹ Cycle: { 2 , 4 , 8 , 6 } \{2, 4, 8, 6\} { 2 , 4 , 8 , 6 } .
3 1 = 3 , 3 2 = 9 , 3 3 = 27 , 3 4 = 81 ⟹ 3^1=3, 3^2=9, 3^3=27, 3^4=81 \implies 3 1 = 3 , 3 2 = 9 , 3 3 = 27 , 3 4 = 81 ⟹ Cycle: { 3 , 9 , 7 , 1 } \{3, 9, 7, 1\} { 3 , 9 , 7 , 1 } .
7 1 = 7 , 7 2 = 49 , 7 3 = 343 , 7 4 = 2401 ⟹ 7^1=7, 7^2=49, 7^3=343, 7^4=2401 \implies 7 1 = 7 , 7 2 = 49 , 7 3 = 343 , 7 4 = 2401 ⟹ Cycle: { 7 , 9 , 3 , 1 } \{7, 9, 3, 1\} { 7 , 9 , 3 , 1 } .
Digital Root (Casting Out Nines) : The digital root of a number is the single-digit sum obtained by repeatedly adding its digits. The digital root of a sum or product must match the digital root of the inputs: DR ( A × B ) = DR ( DR ( A ) × DR ( B ) ) \operatorname{DR}(A \times B) = \operatorname{DR}(\operatorname{DR}(A) \times \operatorname{DR}(B)) DR ( A × B ) = DR ( DR ( A ) × DR ( B )) This provides instant verification of multi-digit arithmetic options.
Parity Arithmetic : Leverage odd/even invariants to eliminate impossible answer choices: Even ± Even = Even , Odd ± Odd = Even , Even ± Odd = Odd \text{Even} \pm \text{Even} = \text{Even}, \quad \text{Odd} \pm \text{Odd} = \text{Even}, \quad \text{Even} \pm \text{Odd} = \text{Odd} Even ± Even = Even , Odd ± Odd = Even , Even ± Odd = Odd Even × Any = Even , Odd × Odd = Odd \text{Even} \times \text{Any} = \text{Even}, \quad \text{Odd} \times \text{Odd} = \text{Odd} Even × Any = Even , Odd × Odd = Odd