5.3 Factors, Multiples, Prime Factorization & Divisibility Rules
Key Takeaways
- The number 1 is neither prime nor composite, while 2 is the smallest prime and the only even prime number.
- Canonical prime factorization provides the mathematical foundation for finding the Greatest Common Factor (lowest shared powers) and Least Common Multiple (highest overall powers).
- GCF is used to simplify fractions and divide quantities into identical groups without leftovers, whereas LCM synchronizes periodic events and determines common denominators.
- Divisibility rules for 2, 3, 4, 5, 6, 8, 9, and 10 allow candidates to eliminate incorrect multiple-choice distractors in under 5 seconds.
- The sum-of-digits test for 3 and 9 rapidly identifies composite 'false primes' such as 51, 57, and 87 without performing manual long division.
5.3 Factors, Multiples, Prime Factorization & Divisibility Rules
Number theory concepts—including factors, multiples, prime factorization, and divisibility rules—form the hidden backbone of mathematical efficiency on the Wonderlic Basic Skills Test (WBST). When solving fraction reductions, common denominator calculations, and word problems, candidates who calculate by trial-and-error long division bleed away valuable time.
With an average of 26.67 seconds per quantitative item, you must be able to decompose numbers rapidly into their foundational prime components and apply universal divisibility tests on sight. These techniques allow you to bypass heavy arithmetic entirely, verify answers in under 5 seconds, and systematically eliminate plausible distractors.
Prime Numbers vs. Composite Numbers: Definitions and Boundary Traps
Every whole number greater than 1 falls into one of two fundamental categories:
- Prime Number: A positive integer strictly greater than 1 that has exactly two distinct positive divisors: 1 and itself.
- Composite Number: A positive integer strictly greater than 1 that has more than two distinct positive divisors (meaning it can be formed by multiplying two smaller positive integers).
THE WHOLE NUMBER TAXONOMY (n ≥ 0)
|
+----------------------------+----------------------------+
| |
[ Special Boundary: 0 & 1 ] [ Integers n ≥ 2 ]
* 0 is neither prime nor composite |
* 1 is NEITHER prime nor composite +----------------+----------------+
(has only ONE distinct factor: 1) | |
[ Prime Numbers ] [ Composite Numbers ]
Exactly 2 factors 3 or more factors
(e.g., 2, 3, 5, 7, 11) (e.g., 4, 6, 8, 9, 12)
Critical Boundary Traps
- The Number 1: The number 1 is NEITHER prime nor composite. It fails the definition of prime because it does not possess two distinct factors (its only factor is 1).
- The Number 2: The number 2 is the smallest prime number and the ONLY even prime number. Every other even number is divisible by 2 and is therefore composite.
- The Primes Under 50: You should have the first 15 prime numbers memorized for instant recognition on test day:
High-Frequency "False Prime" Traps on the WBST
Test writers deliberately include composite numbers that look prime because they are odd and do not end in 5. Memorize these frequent traps:
- 51 is composite: $5 + 1 = 6$ (divisible by 3; $3 × 17 = 51$).
- 57 is composite: $5 + 7 = 12$ (divisible by 3; $3 × 19 = 57$).
- 87 is composite: $8 + 7 = 15$ (divisible by 3; $3 × 29 = 87$).
- 91 is composite: Divisible by 7 and 13 ($7 × 13 = 91$).
- 119 is composite: Divisible by 7 and 17 ($7 × 17 = 119$).
Prime Factorization & Factor Trees
The Fundamental Theorem of Arithmetic states that every integer greater than 1 either is a prime number itself or can be represented as the product of prime numbers in a way that is unique up to the order of the factors. This prime decomposition is the "DNA" of the number.
Constructing a Factor Tree Rapidly
To find the prime factorization of a composite number on scratch paper:
- Choose any two obvious factors of the number (start with 2 if even, or 5/10 if ending in 0 or 5).
- Branch the number into those two factors.
- If a factor is prime, circle it. If it is composite, branch it again.
- Continue until all leaf nodes are circled prime numbers.
- Collect identical primes into exponential prime-power notation.
FACTOR TREE FOR 360
360
/ \
36 × 10
/ \ / \
6 × 6 (2) (5)
/ \ / \
(2)(3)(2)(3)
Collected Prime Factors: 2 × 2 × 2 × 3 × 3 × 5
Canonical Prime-Power Notation: 360 = 2³ × 3² × 5¹
Greatest Common Factor (GCF) and Least Common Multiple (LCM)
Understanding GCF and LCM is essential for fraction operations and applied word problems on the WBST.
- Greatest Common Factor (GCF / GCD): The largest positive integer that divides evenly into two or more given numbers without leaving a remainder. GCF is used to reduce fractions to their simplest terms and to divide quantities into equal groups.
- Least Common Multiple (LCM): The smallest positive integer that is an exact multiple of two or more given numbers. LCM is used to find the Least Common Denominator (LCD) when adding or subtracting fractions and to calculate repeating cycle intervals.
The Prime Factorization Method for GCF and LCM
Once you express two numbers in their prime-power forms, you can find both GCF and LCM instantly using a simple rule:
- For GCF: Take the LOWEST power of each COMMON prime factor.
- For LCM: Take the HIGHEST power of ALL prime factors present in either number.
Comprehensive Worked Comparison: Numbers 72 and 120
First, find the prime factorizations:
| Prime Base | Power in 72 ($2^3 × 3^2$) | Power in 120 ($2^3 × 3^1 × 5^1$) | GCF Selection (Lowest Common Power) | LCM Selection (Highest Overall Power) |
|---|---|---|---|---|
| 2 | $2^3$ | $2^3$ | $2^3 = 8$ | $2^3 = 8$ |
| 3 | $3^2$ | $3^1$ | $3^1 = 3$ | $3^2 = 9$ |
| 5 | $5^0$ (absent) | $5^1$ | None (not common) | $5^1 = 5$ |
| Result | — | — | GCF = $8 × 3 =$ 24 | LCM = $8 × 9 × 5 =$ 360 |
The "Ladder" (Upside-Down Division) Shortcut
When scratch paper space and time are minimal, the ladder method computes GCF and LCM simultaneously:
- Write the numbers side by side:
| 72 120 - Divide both by a shared common factor (e.g., 2):
| 36 60 - Divide again by 2:
| 18 30 - Divide again by 2:
| 9 15 - Divide by 3:
| 3 5(Stop: 3 and 5 are coprime).
- GCF = Product of the vertical left column numbers: $2 × 2 × 2 × 3 = 24$.
- LCM = Product of the vertical column AND the bottom row (in an "L" shape): $24 × 3 × 5 = 360$.
Word Problem Scenario Recognition: GCF vs. LCM
| Scenario Indicator Words | Underlying Mathematical Concept | Typical Workplace / Practical Problem |
|---|---|---|
| "Divide into equal groups," "greatest number of kits," "cut into equal lengths without waste," "maximum identical packages" | GCF | A nurse assembling first aid kits with 60 alcohol pads and 48 gauze rolls into identical packets without leftovers. |
| "Repeat at the same time," "cycle simultaneously," "next time both occur," "minimum number of items to purchase equal amounts" | LCM | Two assembly-line conveyors inspected every 15 minutes and 25 minutes; finding when both are inspected together. |
Comprehensive Divisibility Rules: The Speed Master Reference
Divisibility tests allow you to determine whether an integer is divisible by another number without performing long division. On the WBST, these rules save up to 20 seconds per item.
| Divisor | Divisibility Condition | Applied Example | Verification Analysis |
|---|---|---|---|
| 2 | The last digit of the number is even (0, 2, 4, 6, 8). | 4,738 | Last digit is 8 (even) $\to$ Divisible |
| 3 | The sum of all digits is divisible by 3. | 5,832 | $5 + 8 + 3 + 2 = 18$; $18 ÷ 3 = 6$ $\to$ Divisible |
| 4 | The number formed by the last two digits is divisible by 4 (or ends in 00). | 17,564 | Last two digits are 64; $64 ÷ 4 = 16$ $\to$ Divisible |
| 5 | The last digit of the number is 0 or 5. | 9,425 | Last digit is 5 $\to$ Divisible |
| 6 | The number is divisible by BOTH 2 and 3 (must be even AND have a digit sum divisible by 3). | 8,142 | Even (ends in 2); sum $= 8+1+4+2=15$ ($15÷ 3=5$) $\to$ Divisible |
| 8 | The number formed by the last three digits is divisible by 8 (or ends in 000). | 54,128 | Last three digits are 128; $128 ÷ 8 = 16$ $\to$ Divisible |
| 9 | The sum of all digits is divisible by 9. | 74,538 | $7 + 4 + 5 + 3 + 8 = 27$; $27 ÷ 9 = 3$ $\to$ Divisible |
| 10 | The last digit of the number is 0. | 38,290 | Last digit is 0 $\to$ Divisible |
Advanced Shortcut: Divisibility by 8 Without 3-Digit Division
Dividing a 3-digit number by 8 in your head can be slow. Use the Hundreds Parity Shortcut:
- If the hundreds digit is EVEN, look only at the last two digits: if they are divisible by 8, the whole number is divisible by 8.
- In 624: Hundreds digit 6 is even. Check 24: $24 ÷ 8 = 3$. Divisible!
- If the hundreds digit is ODD, add 4 to the last two digits: if the sum is divisible by 8, the whole number is divisible by 8.
- In 728: Hundreds digit 7 is odd. Add 4 to last two digits: $28 + 4 = 32$. Since $32 ÷ 8 = 4$, 728 is divisible by 8!
Strategic Application: Rapid Distractor Elimination & Computation Simplification
Under the 26.67-second pressure of the WBST Quantitative section, divisibility rules function as high-speed filters:
- Fraction Reduction: If asked to reduce $\frac{162}{216}$:
- Sum of digits for 162: $1 + 6 + 2 = 9$ (divisible by 9).
- Sum of digits for 216: $2 + 1 + 6 = 9$ (divisible by 9).
- Immediately divide numerator and denominator by 9: $\frac{162 ÷ 9}{216 ÷ 9} = \frac{18}{24}$.
- Divide by 6: $\frac{18 ÷ 6}{24 ÷ 6} = \frac{3}{4}$. You reach lowest terms in 6 seconds without testing factors of 2 or 3 repeatedly.
- Instant Multiple-Choice Elimination: If a question asks which number is divisible by 6, immediately eliminate any odd answer choice in 1 second (violates rule for 2). Then test the digit sums of the remaining even choices (rule for 3).
- Prime Number Identification: When presented with four multi-digit numbers and asked to identify the prime number, eliminate options ending in even digits or 5 first. Then calculate digit sums to eliminate multiples of 3. In over 80% of WBST questions, this leaves exactly one candidate standing within 8 seconds.
Which of the following numbers is a prime number?
In a community healthcare clinic, a triage coordinator has 84 surgical face masks and 126 alcohol prep pads to assemble into identical emergency response kits. What is the greatest number of identical kits that can be prepared without leaving any supplies remaining, and how many alcohol prep pads will be in each kit?
A quality control technician needs to identify which five-digit production batch code is evenly divisible by both 4 and 9 without performing long division. Which batch code meets both criteria?