Study guide
2.1 Integers, Divisibility Rules, Prime Factorization, and LCM/GCD
GMAT Exam Focus Edition
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: GMAT Exam Architecture & Strategic Foundations
1.1 GMAT Structure, Section Order, and the 205–805 Score Scale 1.2 Question Bookmarking and the Review & Edit Feature Mechanics 1.3 Test-Day Logistics, Pacing Architecture, and Score Reporting Policies
2 Chapter 2: Quantitative Reasoning — Arithmetic & Number Properties
2.1 Integers, Divisibility Rules, Prime Factorization, and LCM/GCD 2.2 Remainders, Even/Odd Parity, and Positive/Negative Sign Analysis 2.3 Exponents, Radicals, Roots, and Scientific Notation 2.4 Absolute Value, Number Line Properties, and Estimation Techniques
3 Chapter 3: Quantitative Reasoning — Fractions, Decimals, Ratios & Percentages
3.1 Fractions, Decimals, and Real-Number Operations 3.2 Ratios, Proportions, and Scaling Relationships 3.3 Percent Change, Successive Percent Changes, and Multipliers 3.4 Commercial Math: Profit/Loss, Markups, Discounts, and Simple/Compound Interest
4 Chapter 4: Quantitative Reasoning — Algebra, Equations & Inequalities
4.1 Linear Equations and Systems of Simultaneous Equations 4.2 Quadratic Equations, Factoring Patterns, and Roots 4.3 Linear Inequalities, Compound Inequalities, and Absolute Value Inequalities 4.4 Functions, Defined Operational Symbols, and Sequences
5 Chapter 5: Quantitative Reasoning — Word Problems & Modeling
5.1 Rate, Time, and Distance: Uniform Motion, Relative Speed, and Average Speed 5.2 Work Rates: Combined Rates, Sequential Tasks, and Opposing Rates 5.3 Mixture Problems and Weighted Averages 5.4 Overlapping Sets, Venn Diagrams, and the Double-Set Matrix Method
6 Chapter 6: Quantitative Reasoning — Counting, Probability & Statistics
6.1 Fundamental Counting Principle, Permutations, and Combinations 6.2 Probability Rules: Independent, Dependent, Mutually Exclusive, and Complementary Events 6.3 Descriptive Statistics: Mean, Median, Mode, Range, and Weighted Mean 6.4 Standard Deviation, Variance, and Data Dispersion
7 Chapter 7: Verbal Reasoning — Critical Reasoning: Argument Structure & Assumptions
7.1 Anatomy of an Argument: Conclusions, Premises, Assumptions, and Background Context 7.2 Assumption Questions: Necessary vs. Sufficient Assumptions and the Negation Test 7.3 Strengthen Questions: Supporting Premises, Causality, and New Evidence 7.4 Weaken Questions: Identifying Flaws, Alternate Causes, and Counter-Evidence
8 Chapter 8: Verbal Reasoning — Critical Reasoning: Advanced Arguments
8.1 Evaluate the Argument: The Variance Test and Decisive Information 8.2 Resolve the Paradox: Reconciling Conflicting Facts and Surprising Outcomes 8.3 Boldface and Method of Reasoning: Identifying the Role of Statements 8.4 Flaw in the Reasoning: Spotting Formal and Informal Logical Fallacies
9 Chapter 9: Verbal Reasoning — Reading Comprehension: Core Analysis
9.1 Passage Structures, Main Idea, and Author's Primary Purpose 9.2 Supporting Ideas, Explicit Details, and Targeted Information Retrieval 9.3 Inference Questions: Deriving Unstated Claims and Valid Deductions
10 Chapter 10: Verbal Reasoning — Reading Comprehension: Advanced Strategies
10.1 Author's Tone, Attitude, and Epistemic Stance 10.2 Logical Structure, Paragraph Function, and Rhetorical Organization 10.3 Application, Contextual Analogy, and Cross-Disciplinary Synthesis
11 Chapter 11: Data Insights — Data Sufficiency Foundations & Algebra
11.1 Data Sufficiency Architecture: The 5 Answer Choices (AD/BCE) and Yes/No vs. Value Logic 11.2 Golden Rules of DS: Preventing Statement 2 Contamination and Sufficiency Verification 11.3 DS Applied to Arithmetic, Number Properties, and Signs 11.4 DS Applied to Algebraic Equations, Systems, and Inequalities
12 Chapter 12: Data Insights — Data Sufficiency Applied Modeling
12.1 DS Applied to Rates, Ratios, and Work Problems 12.2 DS Applied to Statistics, Averages, and Data Sets 12.3 DS Applied to Overlapping Sets, Venn Diagrams, and Probability
13 Chapter 13: Data Insights — Multi-Source Reasoning & Table Analysis
13.1 Multi-Source Reasoning: Tab Navigation, Synthesizing Text, Data, and Emails 13.2 MSR Question Formats: Multiple Choice and Three-Part Dichotomous Questions 13.3 Table Analysis: Interactive Sorting, Filtering, and Trend Identification 13.4 Table Analysis: Evaluating Binary Statements (True/False, Yes/No)
14 Chapter 14: Data Insights — Graphics Interpretation & Two-Part Analysis
14.1 Graphics Interpretation: Bar Charts, Line Graphs, and Scatterplots 14.2 Graphics Interpretation: Bubble Charts, Dual-Axis Graphs, and Pie Charts 14.3 Two-Part Analysis: Quantitative and Mathematical Word Problems 14.4 Two-Part Analysis: Verbal, Logic-Based, and Strategic Decision Problems
2.1 Integers, Divisibility Rules, Prime Factorization, and LCM/GCD
Key Takeaways Explain This Topic AI
Integers encompass positive whole numbers, negative whole numbers, and zero; zero is an even integer that is neither positive nor negative.
Rapid mental divisibility tests for divisors 2 through 12 bypass manual long division on the calculator-free Quantitative Reasoning section.
The Fundamental Theorem of Arithmetic guarantees unique prime factorization, unlocking total factor counts via the formula (a + 1)(b + 1)(c + 1)...
Greatest Common Divisor (GCD) extracts lowest common prime exponents, Least Common Multiple (LCM) extracts highest prime exponents, and GCD(a, b) × LCM(a, b) = a × b.
Last updated: September 2026
2.1 Integers, Divisibility Rules, Prime Factorization, and LCM/GCD
Quick Summary: On the GMAT Focus Edition Quantitative Reasoning section, calculators are strictly prohibited. Mastery of integer classifications, mental divisibility rules (2 through 12), canonical prime factorization trees, and the algebraic relationship GCD ( a , b ) × LCM ( a , b ) = a × b \text{GCD}(a, b) \times \text{LCM}(a, b) = a \times b GCD ( a , b ) × LCM ( a , b ) = a × b allows you to dismantle complex Problem Solving questions rapidly without laborious manual arithmetic.
Arithmetic and number properties form the computational and conceptual backbone of the GMAT Focus Quantitative Reasoning measure. Because all 21 Quantitative Reasoning questions are Problem Solving items delivered without calculator access, the exam tests your structural understanding of how numbers interact rather than your ability to perform tedious pencil-and-paper calculations.
Integer Classification and the Special Properties of Zero
The set of integers (denoted mathematically as Z \mathbb{Z} Z ) consists of all whole numbers, their negative opposites, and zero: 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 , … }
Notice that fractions, non-terminating decimals, irrational numbers (such as 2 \sqrt{2} 2 or π \pi π ), and imaginary numbers are not integers. On the GMAT, questions frequently impose integer constraints using specific terms that you must interpret with complete precision:
Natural Numbers (Counting Numbers): The positive integers { 1 , 2 , 3 , 4 , … } \{1, 2, 3, 4, \dots\} { 1 , 2 , 3 , 4 , … } .
Whole Numbers: Non-negative integers { 0 , 1 , 2 , 3 , … } \{0, 1, 2, 3, \dots\} { 0 , 1 , 2 , 3 , … } .
Non-Negative Integers: All integers greater than or equal to zero ( x ≥ 0 x \ge 0 x ≥ 0 ). This includes 0!
Non-Positive Integers: All integers less than or equal to zero ( x ≤ 0 x \le 0 x ≤ 0 ). This includes 0!
The Critical Arithmetic Rules of Zero
Zero is a frequent source of test-day traps because it possesses unique mathematical properties that separate it from all other integers:
Zero is an Integer: Zero has no fractional or decimal component.
Zero is Even: By formal mathematical definition, an integer n n n is even if and only if n = 2 k n = 2k n = 2 k for some integer k k k . Setting k = 0 k = 0 k = 0 yields 0 = 2 ( 0 ) 0 = 2(0) 0 = 2 ( 0 ) . Because 0 divides by 2 with a remainder of 0, zero is strictly even .
Zero is Neither Positive nor Negative: Zero is the neutral origin on the real number line. It divides positive values from negative values. If a problem states that n n n is a "positive integer," n n n cannot be 0 ( n ≥ 1 n \ge 1 n ≥ 1 ).
Zero is a Multiple of Every Integer: For any integer k k k , 0 = k × 0 0 = k \times 0 0 = k × 0 . Thus, 0 is a multiple of 3, a multiple of 7, and a multiple of 84. However, zero is never a factor or divisor of any number.
Division by Zero is Undefined: While 0 / k = 0 0 / k = 0 0/ k = 0 for any non-zero integer k k k , the expression k / 0 k / 0 k /0 is mathematically undefined. In algebraic expressions such as x − 4 y + 2 \frac{x - 4}{y + 2} y + 2 x − 4 , you must immediately recognize the implied domain restriction y ≠ − 2 y \neq -2 y = − 2 .
Mental Divisibility Rules (2 through 12)
An integer N N N is divisible by a non-zero integer d d d if the quotient N / d N / d N / d is an integer with a remainder of 0. In such cases, d d d is a factor (or divisor ) of N N N , and N N N is a multiple of d d d .
To solve Problem Solving questions in under two minutes without a calculator, you must execute mental divisibility checks automatically.
Divisor Divisibility Condition Mental Math Test & Example
2 The units 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 ⟹ \implies ⟹ divisible by 2.
3 The sum of all digits is divisible by 3. For 7 , 419 7,419 7 , 419 : 7 + 4 + 1 + 9 = 21 7 + 4 + 1 + 9 = 21 7 + 4 + 1 + 9 = 21 . Since 21 is divisible by 3, 7 , 419 7,419 7 , 419 is divisible by 3.
4 The number formed by the last two digits is divisible by 4. For 18 , 364 18,364 18 , 364 : inspect 64. Since 64 / 4 = 16 64 / 4 = 16 64/4 = 16 , 18 , 364 18,364 18 , 364 is divisible by 4.
5 The units digit is 0 or 5. 39 , 215 39,215 39 , 215 ends in 5 ⟹ \implies ⟹ divisible by 5.
6 The number passes both the test for 2 and the test for 3. For 5 , 136 5,136 5 , 136 : ends in 6 (even) and 5 + 1 + 3 + 6 = 15 5 + 1 + 3 + 6 = 15 5 + 1 + 3 + 6 = 15 ( 15 / 3 = 5 15 / 3 = 5 15/3 = 5 ). Both pass ⟹ \implies ⟹ divisible by 6.
7 Double the last digit and subtract from the remaining truncated number; check if result is divisible by 7. For 2 , 401 2,401 2 , 401 : 240 − 2 ( 1 ) = 238 ⟹ 23 − 2 ( 8 ) = 7 240 - 2(1) = 238 \implies 23 - 2(8) = 7 240 − 2 ( 1 ) = 238 ⟹ 23 − 2 ( 8 ) = 7 . Since 7 is divisible by 7, 2 , 401 2,401 2 , 401 is divisible by 7.
8 The number formed by the last three digits is divisible by 8. For 53 , 128 53,128 53 , 128 : inspect 128. Since 128 / 8 = 16 128 / 8 = 16 128/8 = 16 , 53 , 128 53,128 53 , 128 is divisible by 8. (Shortcut: if hundreds digit is odd, check if last two digits + 4 + 4 + 4 is divisible by 8).
9 The sum of all digits is divisible by 9. For 85 , 293 85,293 85 , 293 : 8 + 5 + 2 + 9 + 3 = 27 8 + 5 + 2 + 9 + 3 = 27 8 + 5 + 2 + 9 + 3 = 27 . Since 27 / 9 = 3 27 / 9 = 3 27/9 = 3 , 85 , 293 85,293 85 , 293 is divisible by 9.
10 The units digit is 0. 91 , 480 91,480 91 , 480 ends in 0 ⟹ \implies ⟹ divisible by 10.
11 The alternating sum of digits (subtracting and adding alternately) is divisible by 11 (including 0). For 94 , 853 94,853 94 , 853 : ( 3 + 8 + 9 ) − ( 5 + 4 ) = 20 − 9 = 11 (3 + 8 + 9) - (5 + 4) = 20 - 9 = 11 ( 3 + 8 + 9 ) − ( 5 + 4 ) = 20 − 9 = 11 . Since 11 is divisible by 11, 94 , 853 94,853 94 , 853 is divisible by 11.
12 The number passes both the test for 3 and the test for 4. For 4 , 572 4,572 4 , 572 : 4 + 5 + 7 + 2 = 18 4 + 5 + 7 + 2 = 18 4 + 5 + 7 + 2 = 18 (divisible by 3) and last two digits are 72 ( 72 / 4 = 18 72 / 4 = 18 72/4 = 18 , divisible by 4). Divisible by 12.
The Coprime Factor Rule for Composite Divisors
A common mistake on composite divisibility is testing non-coprime factors. To test whether an integer is divisible by a composite divisor C = a × b C = a \times b C = a × b , the factors a a a and b b b must be relatively prime (meaning GCD ( a , b ) = 1 \text{GCD}(a, b) = 1 GCD ( a , b ) = 1 ):
To test for divisibility by 12, you must test 3 and 4 ( GCD ( 3 , 4 ) = 1 \text{GCD}(3, 4) = 1 GCD ( 3 , 4 ) = 1 ). You cannot test 2 and 6, because a number such as 18 is divisible by both 2 and 6, yet it is not divisible by 12 ( 18 / 12 = 1.5 18 / 12 = 1.5 18/12 = 1.5 ).
To test for divisibility by 18, test 2 and 9 ( GCD ( 2 , 9 ) = 1 \text{GCD}(2, 9) = 1 GCD ( 2 , 9 ) = 1 ).
To test for divisibility by 36, test 4 and 9 ( GCD ( 4 , 9 ) = 1 \text{GCD}(4, 9) = 1 GCD ( 4 , 9 ) = 1 ).
Prime Numbers and Canonical Prime Factorization
A prime number is an integer greater than 1 that possesses exactly two distinct positive divisors : 1 and itself.
Fundamental Prime Facts to Memorize
1 is NOT a prime number: The number 1 has only one positive divisor (itself).
2 is the ONLY even prime number: Every other even integer is divisible by 2 and therefore composite. The number 2 is also the smallest prime number.
All primes greater than 2 are odd , but not all odd numbers are prime (e.g., 9, 15, 21, 25, 27 are composite).
The first 15 prime numbers: 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 , 31 , 37 , 41 , 43 , 47 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 , 31 , 37 , 41 , 43 , 47
The Fundamental Theorem of Arithmetic
The Fundamental Theorem of Arithmetic states that every integer N > 1 N > 1 N > 1 can be expressed as a product of prime numbers in exactly one way, up to the order of the factors. This canonical prime factorization takes the form: N = p 1 a ⋅ p 2 b ⋅ p 3 c ⋯ N = p_1^{a} \cdot p_2^{b} \cdot p_3^{c} \cdots N = p 1 a ⋅ p 2 b ⋅ p 3 c ⋯
where p 1 , p 2 , p 3 p_1, p_2, p_3 p 1 , p 2 , p 3 are distinct prime numbers and a , b , c a, b, c a , b , c are positive integer exponents.
Formula for the Total Number of Positive Divisors
Given the canonical prime factorization N = p 1 a ⋅ p 2 b ⋅ p 3 c … N = p_1^{a} \cdot p_2^{b} \cdot p_3^{c} \dots N = p 1 a ⋅ p 2 b ⋅ p 3 c … , any positive factor d d d of N N N must have the prime factorization: d = p 1 x ⋅ p 2 y ⋅ p 3 z … d = p_1^{x} \cdot p_2^{y} \cdot p_3^{z} \dots d = p 1 x ⋅ p 2 y ⋅ p 3 z …
where 0 ≤ x ≤ a 0 \le x \le a 0 ≤ x ≤ a , 0 ≤ y ≤ b 0 \le y \le b 0 ≤ y ≤ b , and 0 ≤ z ≤ c 0 \le z \le c 0 ≤ z ≤ c . By the Fundamental Counting Principle, the number of choices for exponent x x x is ( a + 1 ) (a + 1) ( a + 1 ) , for y y y is ( b + 1 ) (b + 1) ( b + 1 ) , and for z z z is ( c + 1 ) (c + 1) ( c + 1 ) . Therefore: Total Positive Divisors = ( a + 1 ) ( b + 1 ) ( c + 1 ) ⋯ \text{Total Positive Divisors} = (a + 1)(b + 1)(c + 1)\cdots Total Positive Divisors = ( a + 1 ) ( b + 1 ) ( c + 1 ) ⋯
Example: Total Divisors of 360
Prime factorizing 360: 360 = 36 × 10 = ( 2 2 × 3 2 ) × ( 2 × 5 ) = 2 3 × 3 2 × 5 1 360 = 36 \times 10 = (2^2 \times 3^2) \times (2 \times 5) = 2^3 \times 3^2 \times 5^1 360 = 36 × 10 = ( 2 2 × 3 2 ) × ( 2 × 5 ) = 2 3 × 3 2 × 5 1
Applying the formula: Total Divisors = ( 3 + 1 ) ( 2 + 1 ) ( 1 + 1 ) = 4 × 3 × 2 = 24 \text{Total Divisors} = (3 + 1)(2 + 1)(1 + 1) = 4 \times 3 \times 2 = 24 Total Divisors = ( 3 + 1 ) ( 2 + 1 ) ( 1 + 1 ) = 4 × 3 × 2 = 24
Exam Takeaway on Perfect Squares: An integer has an odd number of total positive factors if and only if it is a perfect square . In any perfect square, all prime exponents a , b , c a, b, c a , b , c are even numbers, meaning ( a + 1 ) , ( b + 1 ) , ( c + 1 ) (a + 1), (b + 1), (c + 1) ( a + 1 ) , ( b + 1 ) , ( c + 1 ) are all odd numbers, producing an odd product.
- Greatest Common Divisor (GCD) and Least Common Multiple (LCM)
- Greatest Common Divisor (GCD)
The Greatest Common Divisor (or Greatest Common Factor, GCF) of two or more positive integers is the largest positive integer that divides all of them without leaving a remainder.
Method: Prime factorize each number and take the lowest exponent of each prime factor that is common to all factorizations.
Least Common Multiple (LCM)
The Least Common Multiple of two or more positive integers is the smallest positive integer that is a multiple of all of them.
Method: Prime factorize each number and take the highest exponent of every prime factor present in any of the factorizations.
The Core Product Identity
For any two positive integers a a a and b b b : GCD ( a , b ) × LCM ( a , b ) = a × b \text{GCD}(a, b) \times \text{LCM}(a, b) = a \times b GCD ( a , b ) × LCM ( a , b ) = a × b
Caution: This product formula applies strictly to two integers . For three integers, GCD ( a , b , c ) × LCM ( a , b , c ) ≠ a × b × c \text{GCD}(a, b, c) \times \text{LCM}(a, b, c) \neq a \times b \times c GCD ( a , b , c ) × LCM ( a , b , c ) = a × b × c in general.
- Worked Problem Solving Examples
- Example 1: Finding Constrained Divisors
Problem: If N = 2 4 × 3 3 × 5 2 × 7 1 N = 2^4 \times 3^3 \times 5^2 \times 7^1 N = 2 4 × 3 3 × 5 2 × 7 1 , how many positive divisors of N N N are multiples of 36?
Solution:
Express the constraint condition (being a multiple of 36) in prime factored form: 36 = 4 × 9 = 2 2 × 3 2 36 = 4 \times 9 = 2^2 \times 3^2 36 = 4 × 9 = 2 2 × 3 2
Factor 2 2 × 3 2 2^2 \times 3^2 2 2 × 3 2 out of the prime factorization of N N N : N = ( 2 2 × 3 2 ) × ( 2 4 − 2 × 3 3 − 2 × 5 2 × 7 1 ) = 36 × ( 2 2 × 3 1 × 5 2 × 7 1 ) N = (2^2 \times 3^2) \times \left(2^{4-2} \times 3^{3-2} \times 5^2 \times 7^1\right) = 36 \times \left(2^2 \times 3^1 \times 5^2 \times 7^1\right) N = ( 2 2 × 3 2 ) × ( 2 4 − 2 × 3 3 − 2 × 5 2 × 7 1 ) = 36 × ( 2 2 × 3 1 × 5 2 × 7 1 )
Any divisor of the remaining quotient Q = 2 2 × 3 1 × 5 2 × 7 1 Q = 2^2 \times 3^1 \times 5^2 \times 7^1 Q = 2 2 × 3 1 × 5 2 × 7 1 , when multiplied by 36, produces a unique divisor of N N N that is a multiple of 36.
Apply the divisor formula to Q Q Q : Number of factors = ( 2 + 1 ) ( 1 + 1 ) ( 2 + 1 ) ( 1 + 1 ) = 3 × 2 × 3 × 2 = 36 \text{Number of factors} = (2 + 1)(1 + 1)(2 + 1)(1 + 1) = 3 \times 2 \times 3 \times 2 = 36 Number of factors = ( 2 + 1 ) ( 1 + 1 ) ( 2 + 1 ) ( 1 + 1 ) = 3 × 2 × 3 × 2 = 36
There are 36 positive divisors of N N N that are multiples of 36.
Example 2: Reconstructing an Integer from GCD and LCM
Problem: The greatest common divisor of two positive integers x x x and 108 is 18, and their least common multiple is 540. What is the value of x x x ?
Solution:
Use the two-integer identity: x × 108 = GCD ( x , 108 ) × LCM ( x , 108 ) x \times 108 = \text{GCD}(x, 108) \times \text{LCM}(x, 108) x × 108 = GCD ( x , 108 ) × LCM ( x , 108 ) .
Substitute the given values: x × 108 = 18 × 540 x \times 108 = 18 \times 540 x × 108 = 18 × 540
Isolate x x x using mental factorization rather than large multiplication: x = 18 × 540 108 = 18 108 × 540 = 1 6 × 540 = 90 x = \frac{18 \times 540}{108} = \frac{18}{108} \times 540 = \frac{1}{6} \times 540 = 90 x = 108 18 × 540 = 108 18 × 540 = 6 1 × 540 = 90
Check prime factorizations:
- 108 = 2 2 × 3 3 108 = 2^2 \times 3^3 108 = 2 2 × 3 3
- 90 = 2 1 × 3 2 × 5 1 90 = 2^1 \times 3^2 \times 5^1 90 = 2 1 × 3 2 × 5 1
GCD = 2 min ( 2 , 1 ) × 3 min ( 3 , 2 ) = 2 1 × 3 2 = 18 \text{GCD} = 2^{\min(2, 1)} \times 3^{\min(3, 2)} = 2^1 \times 3^2 = 18 GCD = 2 m i n ( 2 , 1 ) × 3 m i n ( 3 , 2 ) = 2 1 × 3 2 = 18
LCM = 2 max ( 2 , 1 ) × 3 max ( 3 , 2 ) × 5 max ( 0 , 1 ) = 2 2 × 3 3 × 5 1 = 4 × 27 × 5 = 540 \text{LCM} = 2^{\max(2, 1)} \times 3^{\max(3, 2)} \times 5^{\max(0, 1)} = 2^2 \times 3^3 \times 5^1 = 4 \times 27 \times 5 = 540 LCM = 2 m a x ( 2 , 1 ) × 3 m a x ( 3 , 2 ) × 5 m a x ( 0 , 1 ) = 2 2 × 3 3 × 5 1 = 4 × 27 × 5 = 540 Everything checks out; x = 90 x = 90 x = 90 .
High-Frequency GMAT Traps & Pacing Strategies
Trap 1: "Divisors" vs. "Distinct Prime Factors": Read the question stem carefully. If an item asks for the number of prime factors of 72, the answer is 5 ( 2 × 2 × 2 × 3 × 3 2 \times 2 \times 2 \times 3 \times 3 2 × 2 × 2 × 3 × 3 ). If it asks for the number of distinct prime factors , the answer is 2 (only 2 and 3). If it asks for total positive divisors , the answer is ( 3 + 1 ) ( 1 + 1 ) = 12 (3 + 1)(1 + 1) = 12 ( 3 + 1 ) ( 1 + 1 ) = 12 .
Trap 2: Forgetting Negative Factors: Unless the prompt explicitly states "positive divisors" or "positive factors," factors can be negative. For example, 6 has positive factors { 1 , 2 , 3 , 6 } \{1, 2, 3, 6\} { 1 , 2 , 3 , 6 } and total integer factors { ± 1 , ± 2 , ± 3 , ± 6 } \{\pm 1, \pm 2, \pm 3, \pm 6\} { ± 1 , ± 2 , ± 3 , ± 6 } (8 total).
Trap 3: Assuming 1 is Prime: 1 is neither prime nor composite. Including 1 in prime counts will invalidate your answer.