Study guide
2.2 Divisibility, Prime Factorization, Factors, and Multiples
CLEP College Mathematics Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Exam Structure, TI-30XS Calculator & Study Strategy
1.1 CLEP College Mathematics Overview, Exam Format & TI-30XS Calculator 1.2 Scoring, Diagnostic Assessment & Study Plan (ACE 50 Benchmark)
2 Chapter 2: Numbers and Number Theory
2.1 The Real Number System, Properties & Operations 2.2 Divisibility, Prime Factorization, Factors, and Multiples 2.3 Unit Conversion, Scientific Notation, Numerical Precision & Absolute Value
3 Chapter 3: Equations, Inequalities & Linear Systems
3.1 Linear Equations, Linear Inequalities & Absolute Value Equations 3.2 Systems of Linear Equations & Coordinate Graphing Methods
4 Chapter 4: Functions, Graphs & Growth Models
4.1 Function Notation, Domain, Range & Evaluation 4.2 Function Graphs, Transformations, Reflections & Symmetries 4.3 Linear vs. Exponential Growth, Logarithms & Applied Modeling
5 Chapter 5: Commercial Math & Interest Calculations
5.1 Percents, Percent Change, Markups, Discounts, Taxes & Profit/Loss 5.2 Simple Interest and Compound Interest 5.3 Continuous Compounding & Effective Annual Yield (APY vs. APR)
6 Chapter 6: Present/Future Value, Annuities & Loan Applications
6.1 Present Value and Future Value of Cash Flows and Ordinary Annuities 6.2 Loans, Mortgages, Credit Cards & Amortization Concepts
7 Chapter 7: Logic and Sets
7.1 Sets, Subsets, Disjoint Sets, and Set Notation 7.2 Set Operations (Union, Intersection, Complement) & Venn Diagrams 7.3 Logical Statements, Connectives, Conditionals & Truth Tables 7.4 Converses, Inverses, Contrapositives, Equivalence & Valid Arguments
8 Chapter 8: Data Analysis and Statistics
8.1 Data Visualizations: Tables, Bar/Line Graphs, Pie Charts & Histograms 8.2 Measures of Central Tendency: Mean, Median & Mode 8.3 Measures of Dispersion: Range, Quartiles, IQR & Boxplots 8.4 Standard Deviation & The Normal Distribution (Empirical Rule)
9 Chapter 9: Counting and Probability
9.1 Fundamental Counting Principle, Permutations & Combinations 9.2 Basic Probability, Sample Spaces, Complementary Events & Odds 9.3 Compound Probability: Addition Rule, Multiplication Rule & Conditional Probability 9.4 Expected Value and Applied Probabilistic Decision-Making
10 Chapter 10: Geometry and Measurement
10.1 Lines, Angles, Parallel and Perpendicular Line Relationships 10.2 Triangles, Similarity, Congruence & The Pythagorean Theorem 10.3 Quadrilaterals, Polygons, Perimeter & Area 10.4 Circles (Circumference, Area, Arcs, Sectors) & 3D Geometry
2.2 Divisibility, Prime Factorization, Factors, and Multiples
Key Takeaways Explain This Topic AI
A prime number is an integer p > 1 p > 1 p > 1 whose only positive divisors are 1 1 1 and p p p ; 2 2 2 is the unique even prime number, while 0 0 0 and 1 1 1 are neither prime nor composite.
By the Fundamental Theorem of Arithmetic, every integer n > 1 n > 1 n > 1 possesses a unique prime factorization p 1 a 1 p 2 a 2 ⋯ p k a k p_1^{a_1} p_2^{a_2} \cdots p_k^{a_k} p 1 a 1 p 2 a 2 ⋯ p k a k , which determines its total positive divisor count as ( a 1 + 1 ) ( a 2 + 1 ) ⋯ ( a k + 1 ) (a_1 + 1)(a_2 + 1)\cdots(a_k + 1) ( a 1 + 1 ) ( a 2 + 1 ) ⋯ ( a k + 1 ) .
The Greatest Common Divisor (GCD) is the product of common prime factors using their lowest powers, while the Least Common Multiple (LCM) is the product of all prime factors using their highest powers, satisfying GCD ( a , b ) × LCM ( a , b ) = a ⋅ b \text{GCD}(a,b) \times \text{LCM}(a,b) = a \cdot b GCD ( a , b ) × LCM ( a , b ) = a ⋅ b .
Fast modular divisibility tests allow rapid factoring: digit sums for 3 3 3 and 9 9 9 , last two digits for 4 4 4 , last digit for 2 2 2 and 5 5 5 , simultaneous divisibility by 2 2 2 and 3 3 3 for 6 6 6 , and last three digits for 8 8 8 .
Parity arithmetic dictates algebraic outcomes: Even ± Even = Even \text{Even} \pm \text{Even} = \text{Even} Even ± Even = Even , Odd ± Odd = Even \text{Odd} \pm \text{Odd} = \text{Even} Odd ± Odd = Even , Even ± Odd = Odd \text{Even} \pm \text{Odd} = \text{Odd} Even ± Odd = Odd , and an integer product is odd if and only if every single factor is odd.
Last updated: August 2026
2.2 Divisibility, Prime Factorization, Factors, and Multiples
Number theory on the CLEP College Mathematics exam evaluates your understanding of integer structure, prime decomposition, factor/multiple relationships, and algebraic parity deduction. Mastering these core principles provides rapid shortcuts for arithmetic simplification, fraction reduction, and algebraic proof questions.
1. Fast Divisibility Rules & Modular Tests
Divisibility rules allow you to determine whether an integer n n n is divisible by a divisor d d d without executing long division.
Divisor Divisibility Condition Mathematical Justification Illustrative Example
2 Last digit is even ( 0 , 2 , 4 , 6 , 8 0, 2, 4, 6, 8 0 , 2 , 4 , 6 , 8 ). 10 ≡ 0 ( m o d 2 ) 10 \equiv 0 \pmod 2 10 ≡ 0 ( mod 2 ) , so only units digit matters. 4 , 836 ⟹ 6 4,836 \implies 6 4 , 836 ⟹ 6 is even (Divisible)
3 The sum of all digits is divisible by 3 3 3 . 10 k = ( 99 … 9 + 1 ) ≡ 1 ( m o d 3 ) 10^k = (99\dots9 + 1) \equiv 1 \pmod 3 1 0 k = ( 99 … 9 + 1 ) ≡ 1 ( mod 3 ) . 7 , 419 ⟹ 7 + 4 + 1 + 9 = 21 7,419 \implies 7+4+1+9 = 21 7 , 419 ⟹ 7 + 4 + 1 + 9 = 21 ( 21 ÷ 3 = 7 21 \div 3 = 7 21 ÷ 3 = 7 )
4 The integer formed by the last two digits is divisible by 4 4 4 . 100 = 4 × 25 ≡ 0 ( m o d 4 ) 100 = 4 \times 25 \equiv 0 \pmod 4 100 = 4 × 25 ≡ 0 ( mod 4 ) . 58 , 324 ⟹ 24 ÷ 4 = 6 58,324 \implies 24 \div 4 = 6 58 , 324 ⟹ 24 ÷ 4 = 6 (Divisible)
5 The units digit is either 0 0 0 or 5 5 5 . 10 ≡ 0 ( m o d 5 ) 10 \equiv 0 \pmod 5 10 ≡ 0 ( mod 5 ) . 93 , 485 ⟹ 93,485 \implies 93 , 485 ⟹ ends in 5 5 5 (Divisible)
6 Divisible by both 2 2 2 (even) AND 3 3 3 (digit sum div by 3 3 3 ). 6 = 2 × 3 6 = 2 \times 3 6 = 2 × 3 , where gcd ( 2 , 3 ) = 1 \gcd(2,3) = 1 g cd ( 2 , 3 ) = 1 . 8 , 532 ⟹ 8,532 \implies 8 , 532 ⟹ even, 8 + 5 + 3 + 2 = 18 8+5+3+2 = 18 8 + 5 + 3 + 2 = 18 (Divisible)
8 The integer formed by the last three digits is divisible by 8 8 8 . 1 , 000 = 8 × 125 ≡ 0 ( m o d 8 ) 1,000 = 8 \times 125 \equiv 0 \pmod 8 1 , 000 = 8 × 125 ≡ 0 ( mod 8 ) . 41 , 128 ⟹ 128 ÷ 8 = 16 41,128 \implies 128 \div 8 = 16 41 , 128 ⟹ 128 ÷ 8 = 16 (Divisible)
9 The sum of all digits is divisible by 9 9 9 . 10 k ≡ 1 ( m o d 9 ) 10^k \equiv 1 \pmod 9 1 0 k ≡ 1 ( mod 9 ) . 84 , 978 ⟹ 8 + 4 + 9 + 7 + 8 = 36 84,978 \implies 8+4+9+7+8 = 36 84 , 978 ⟹ 8 + 4 + 9 + 7 + 8 = 36 ( 36 ÷ 9 = 4 36 \div 9 = 4 36 ÷ 9 = 4 )
10 The units digit is 0 0 0 . 10 ≡ 0 ( m o d 10 ) 10 \equiv 0 \pmod{10} 10 ≡ 0 ( mod 10 ) . 740 ⟹ 740 \implies 740 ⟹ ends in 0 0 0 (Divisible)
Composite Divisibility Rule (Coprime Factorization)
To test divisibility by a composite number C = p ⋅ q C = p \cdot q C = p ⋅ q , where p p p and q q q are relatively prime (meaning GCD ( p , q ) = 1 \text{GCD}(p, q) = 1 GCD ( p , q ) = 1 ):
Divisibility by 12: Must be divisible by both 3 3 3 (sum of digits) and 4 4 4 (last two digits).
Divisibility by 15: Must be divisible by both 3 3 3 (sum of digits) and 5 5 5 (ends in 0 0 0 or 5 5 5 ).
Divisibility by 18: Must be divisible by both 2 2 2 (even) and 9 9 9 (sum of digits div by 9 9 9 ).
- 2. Primes, Composites & The Fundamental Theorem of Arithmetic
- Definitions & Edge Cases
Prime Number: An integer p > 1 p > 1 p > 1 that has exactly two distinct positive divisors: 1 1 1 and p p p .
Composite Number: An integer n > 1 n > 1 n > 1 that has more than two positive divisors (i.e., can be factored into a × b a \times b a × b with 1 < a , b < n 1 < a, b < n 1 < a , b < n ).
Special Cases:
The number 1 1 1 is neither prime nor composite (it is a unit).
The number 0 0 0 is neither prime nor composite .
The number 2 2 2 is the smallest prime and the ONLY even prime number.
The First 25 Prime Numbers ( < 100 < 100 < 100 ) 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
The Fundamental Theorem of Arithmetic
Every positive integer n > 1 n > 1 n > 1 can be uniquely factored as a product of prime powers: n = p 1 a 1 p 2 a 2 p 3 a 3 ⋯ p k a k n = p_1^{a_1} p_2^{a_2} p_3^{a_3} \cdots p_k^{a_k} n = p 1 a 1 p 2 a 2 p 3 a 3 ⋯ p k a k
where p 1 < p 2 < ⋯ < p k p_1 < p_2 < \dots < p_k p 1 < p 2 < ⋯ < p k are distinct prime numbers and each a i a_i a i is a positive integer exponent. This factorization is unique up to the order of factors.
Formula for the Total Number of Positive Divisors
If the canonical prime factorization of n n n is p 1 a 1 p 2 a 2 ⋯ p k a k p_1^{a_1} p_2^{a_2} \cdots p_k^{a_k} p 1 a 1 p 2 a 2 ⋯ p k a k , the total number of distinct positive divisors d ( n ) d(n) d ( n ) is given by: d ( n ) = ( a 1 + 1 ) ( a 2 + 1 ) ( a 3 + 1 ) ⋯ ( a k + 1 ) d(n) = (a_1 + 1)(a_2 + 1)(a_3 + 1)\cdots(a_k + 1) d ( n ) = ( a 1 + 1 ) ( a 2 + 1 ) ( a 3 + 1 ) ⋯ ( a k + 1 )
Worked Example 1: Finding Total Divisors
Problem: Determine the total number of distinct positive divisors of N = 360 N = 360 N = 360 .
Decompose 360 360 360 into prime factors: 360 = 36 × 10 = ( 2 2 ⋅ 3 2 ) × ( 2 ⋅ 5 ) = 2 3 ⋅ 3 2 ⋅ 5 1 360 = 36 \times 10 = (2^2 \cdot 3^2) \times (2 \cdot 5) = 2^3 \cdot 3^2 \cdot 5^1 360 = 36 × 10 = ( 2 2 ⋅ 3 2 ) × ( 2 ⋅ 5 ) = 2 3 ⋅ 3 2 ⋅ 5 1
Apply the divisor count formula using exponents a 1 = 3 a_1 = 3 a 1 = 3 , a 2 = 2 a_2 = 2 a 2 = 2 , a 3 = 1 a_3 = 1 a 3 = 1 : d ( 360 ) = ( 3 + 1 ) ( 2 + 1 ) ( 1 + 1 ) = 4 × 3 × 2 = 24 d(360) = (3 + 1)(2 + 1)(1 + 1) = 4 \times 3 \times 2 = 24 d ( 360 ) = ( 3 + 1 ) ( 2 + 1 ) ( 1 + 1 ) = 4 × 3 × 2 = 24 Thus, 360 360 360 has exactly 24 24 24 positive divisors.
- 3. Greatest Common Divisor (GCD) & Least Common Multiple (LCM)
- Definitions
Greatest Common Divisor ( GCD \text{GCD} GCD or GCF \text{GCF} GCF ): The largest positive integer that divides both a a a and b b b without remainder.
Least Common Multiple ( LCM \text{LCM} LCM ): The smallest positive integer that is a multiple of both a a a and b b b .
Prime Factorization Algorithm for GCD and LCM
Given two integers a a a and b b b expressed in terms of all involved prime bases: a = p 1 a 1 p 2 a 2 ⋯ p k a k , b = p 1 b 1 p 2 b 2 ⋯ p k b k a = p_1^{a_1} p_2^{a_2} \cdots p_k^{a_k}, \qquad b = p_1^{b_1} p_2^{b_2} \cdots p_k^{b_k} a = p 1 a 1 p 2 a 2 ⋯ p k a k , b = p 1 b 1 p 2 b 2 ⋯ p k b k
GCD ( a , b ) \text{GCD}(a,b) GCD ( a , b ) takes the minimum exponent for each prime factor: GCD ( a , b ) = p 1 min ( a 1 , b 1 ) p 2 min ( a 2 , b 2 ) ⋯ p k min ( a k , b k ) \text{GCD}(a,b) = p_1^{\min(a_1,b_1)} p_2^{\min(a_2,b_2)} \cdots p_k^{\min(a_k,b_k)} GCD ( a , b ) = p 1 m i n ( a 1 , b 1 ) p 2 m i n ( a 2 , b 2 ) ⋯ p k m i n ( a k , b k )
LCM ( a , b ) \text{LCM}(a,b) LCM ( a , b ) takes the maximum exponent for each prime factor: LCM ( a , b ) = p 1 max ( a 1 , b 1 ) p 2 max ( a 2 , b 2 ) ⋯ p k max ( a k , b k ) \text{LCM}(a,b) = p_1^{\max(a_1,b_1)} p_2^{\max(a_2,b_2)} \cdots p_k^{\max(a_k,b_k)} LCM ( a , b ) = p 1 m a x ( a 1 , b 1 ) p 2 m a x ( a 2 , b 2 ) ⋯ p k m a x ( a k , b k )
Worked Example 2: Prime Factorization Grid Method
Problem: Find the GCD \text{GCD} GCD and LCM \text{LCM} LCM of 72 72 72 and 120 120 120 .
Prime factorize each integer: 72 = 8 × 9 = 2 3 ⋅ 3 2 ⋅ 5 0 72 = 8 \times 9 = 2^3 \cdot 3^2 \cdot 5^0 72 = 8 × 9 = 2 3 ⋅ 3 2 ⋅ 5 0 120 = 12 × 10 = 2 3 ⋅ 3 1 ⋅ 5 1 120 = 12 \times 10 = 2^3 \cdot 3^1 \cdot 5^1 120 = 12 × 10 = 2 3 ⋅ 3 1 ⋅ 5 1
Extract GCD \text{GCD} GCD (lowest exponents): GCD ( 72 , 120 ) = 2 min ( 3 , 3 ) ⋅ 3 min ( 2 , 1 ) ⋅ 5 min ( 0 , 1 ) = 2 3 ⋅ 3 1 ⋅ 5 0 = 8 × 3 = 24 \text{GCD}(72, 120) = 2^{\min(3,3)} \cdot 3^{\min(2,1)} \cdot 5^{\min(0,1)} = 2^3 \cdot 3^1 \cdot 5^0 = 8 \times 3 = 24 GCD ( 72 , 120 ) = 2 m i n ( 3 , 3 ) ⋅ 3 m i n ( 2 , 1 ) ⋅ 5 m i n ( 0 , 1 ) = 2 3 ⋅ 3 1 ⋅ 5 0 = 8 × 3 = 24
Extract LCM \text{LCM} LCM (highest exponents): LCM ( 72 , 120 ) = 2 max ( 3 , 3 ) ⋅ 3 max ( 2 , 1 ) ⋅ 5 max ( 0 , 1 ) = 2 3 ⋅ 3 2 ⋅ 5 1 = 8 × 9 × 5 = 360 \text{LCM}(72, 120) = 2^{\max(3,3)} \cdot 3^{\max(2,1)} \cdot 5^{\max(0,1)} = 2^3 \cdot 3^2 \cdot 5^1 = 8 \times 9 \times 5 = 360 LCM ( 72 , 120 ) = 2 m a x ( 3 , 3 ) ⋅ 3 m a x ( 2 , 1 ) ⋅ 5 m a x ( 0 , 1 ) = 2 3 ⋅ 3 2 ⋅ 5 1 = 8 × 9 × 5 = 360
The Fundamental Product Duality Theorem
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 \cdot b GCD ( a , b ) × LCM ( a , b ) = a ⋅ b
Verification: 24 × 360 = 8 , 640 24 \times 360 = 8,640 24 × 360 = 8 , 640 , and 72 × 120 = 8 , 640 72 \times 120 = 8,640 72 × 120 = 8 , 640 .
Important
Solving for Unknown Values via Duality: If a CLEP question states: "The GCD of x x x and 84 84 84 is 12 12 12 , and their LCM is 504 504 504 . Find x x x ," apply the duality theorem immediately: x = GCD ( x , 84 ) × LCM ( x , 84 ) 84 = 12 × 504 84 = 6 , 048 84 = 72 x = \frac{\text{GCD}(x, 84) \times \text{LCM}(x, 84)}{84} = \frac{12 \times 504}{84} = \frac{6,048}{84} = 72 x = 84 GCD ( x , 84 ) × LCM ( x , 84 ) = 84 12 × 504 = 84 6 , 048 = 72
4. Parity Arithmetic & Algebraic Deduction
Parity refers to the property of an integer being either even ( 2 k , k ∈ Z 2k, k \in \mathbb{Z} 2 k , k ∈ Z ) or odd ( 2 k + 1 , k ∈ Z 2k + 1, k \in \mathbb{Z} 2 k + 1 , k ∈ Z ). The CLEP frequently presents abstract algebraic questions testing parity constraints.
- Parity Operational Rules +-----------------------------------------------------------------------------+
- | PARITY ARITHMETIC RULES MATRIX |
- | |
- | ADDITION / SUBTRACTION MULTIPLICATION |
- | Even +/- Even = Even Even x Even = Even |
- | Odd +/- Odd = Even Even x Odd = Even |
- | Even +/- Odd = Odd Odd x Odd = Odd |
- | |
- | EXPONENTIATION (for integer n >= 1) |
- | (Even)^n = Even (Odd)^n = Odd |
- +-----------------------------------------------------------------------------+
- Core Deduction Principles
Odd Product Rule: The product of two or more integers is odd if and only if EVERY factor is odd . If even a single factor is even, the entire product is even.
Even Sum Rule: The sum of any number of integers is odd if and only if there is an odd number of odd terms .
Consecutive Integer Parity: In any set of n n n consecutive integers, exactly one integer is divisible by n n n . For any two consecutive integers k k k and k + 1 k+1 k + 1 , exactly one is even and one is odd; their product k ( k + 1 ) k(k+1) k ( k + 1 ) is always even .
Worked Example 3: Algebraic Parity Deduction
Problem: Let m m m be an odd integer and n n n be an even integer. Determine whether the expression A = m 2 + n 2 + 2 m \mathcal{A} = m^2 + n^2 + 2m A = m 2 + n 2 + 2 m must be even or odd.
Evaluate m 2 m^2 m 2 : Since m m m is odd, m 2 = Odd × Odd = Odd m^2 = \text{Odd} \times \text{Odd} = \text{Odd} m 2 = Odd × Odd = Odd .
Evaluate n 2 n^2 n 2 : Since n n n is even, n 2 = Even × Even = Even n^2 = \text{Even} \times \text{Even} = \text{Even} n 2 = Even × Even = Even .
Evaluate 2 m 2m 2 m : Any integer multiplied by 2 2 2 is Even \text{Even} Even .
Sum the components: A = Odd + Even + Even = Odd \mathcal{A} = \text{Odd} + \text{Even} + \text{Even} = \text{Odd} A = Odd + Even + Even = Odd Therefore, m 2 + n 2 + 2 m m^2 + n^2 + 2m m 2 + n 2 + 2 m is always odd .