Historical Context & Motivation
Long before calculators existed, mathematicians needed efficient methods to determine whether one number divides evenly into another. The study of divisibility — whether a division produces a whole number with no remainder — stretches back thousands of years. Ancient civilizations developed clever mental shortcuts that let merchants, astronomers, and engineers work with large numbers quickly. These same shortcuts appear on the ISEE today, where you must solve problems without a calculator under strict time pressure.
The central question these mathematicians tackled is the same one you face on the ISEE: given a number, how can you rapidly determine its factors, check divisibility, or compare two quantities involving multiples — all without performing long division? The rules and strategies in this lesson give you that power.
Core Principles & Definitions
Before diving into specific rules, you need a solid grasp of the vocabulary the ISEE uses. A factor of a number divides into it evenly with no remainder. A multiple of a number is the product of that number and any positive integer. Divisibility rules are mental tests that tell you whether a specific factor exists without performing the full division.
Factor
Multiple
Prime Number
Prime Factorization
GCF & LCM
Visual Explanation — The Divisibility Decision Tree
The diagram below shows a decision-tree approach to checking divisibility by the most commonly tested divisors on the ISEE. Start at the top with your number and follow the branches. Each test is a quick mental check based on digit properties, and the result tells you which factors your number has.
Notice how the tests build on each other. The rule for 6 combines the rules for 2 and 3 because 6 = 2 × 3, and those primes share no common factors. Similarly, testing divisibility by 12 means checking both ÷ 4 and ÷ 3. On the ISEE, recognizing these combinations lets you test larger divisors in seconds.
Mathematical Framework — The Rules in Detail
Each divisibility rule exploits a property of our base-10 number system. Here are the rules you are most likely to need on the ISEE, expressed precisely so you can apply them with confidence.
GCF and LCM via Prime Factorization
Many ISEE problems ask you to find the greatest common factor (GCF) or least common multiple (LCM) of two numbers. The most reliable method is prime factorization. Write each number as a product of primes, then apply two simple rules: the GCF is the product of shared primes taken to their lowest powers, and the LCM is the product of all primes taken to their highest powers.
Detailed Breakdown — Factor Trees & Relationships
A factor tree is a visual tool that breaks a number down step-by-step into its prime components. The diagram below shows factor trees for 72 and 120, and then demonstrates how to extract the GCF and LCM from their prime factorizations. This technique is essential for ISEE problems involving shared factors or common multiples.
Worked Example
Let's walk through an ISEE-style problem step by step. This example combines divisibility rules with GCF reasoning — exactly the kind of multi-step question that appears on the exam.
ISEE Strategies — Strengths & Pitfalls
Knowing the rules is half the battle. The other half is knowing when and how to deploy them under test conditions. The table below compares common approaches and identifies where students typically lose points.
| Strategy | Strengths | Common Pitfalls |
|---|---|---|
| Divisibility rules | Instant yes/no answer for specific divisors; no computation needed | Students confuse the rule for 4 (last two digits) with the rule for 8 (last three digits) |
| Factor trees | Systematic; always produces complete prime factorization | Time-consuming with large numbers; students sometimes stop before reaching all primes |
| Listing factors | Works well for small numbers; intuitive | Easy to miss factor pairs; impractical for numbers above 100 |
| GCF × LCM = a × b | Powerful shortcut when one of GCF or LCM is given | Only works for exactly two numbers, not three or more |
| Testing answer choices | Uses the ISEE multiple-choice format to your advantage | Can waste time if you test in the wrong order; always start with the largest choice for GCF questions |
Connections to Advanced Topics
Divisibility and factor rules are not isolated tricks — they connect directly to several broader mathematical topics that surface on the ISEE and in future coursework. Understanding these connections helps you see patterns across different types of problems.
| This Lesson | Advanced Connection |
|---|---|
| Divisibility by 2, 3, 5 | Modular arithmetic (remainders): N mod 3 = 0 means divisible by 3. This is the formal basis for all divisibility rules. |
| Prime factorization | Simplifying fractions and rational expressions in Algebra 2. Every fraction reduces by dividing numerator and denominator by their GCF. |
| GCF and LCM | Adding fractions with unlike denominators (LCD = LCM of denominators) and solving systems involving periodic events (e.g., 'when do two buses arrive at the same time?'). |
| Factor-counting formula | Combinatorics and probability: counting divisors is a special case of the multiplication principle. |
| Testing values in QC | Proof by counterexample in higher math: finding one case where a claim fails is enough to disprove it. |
On the ISEE, you can expect divisibility concepts embedded in word problems about scheduling, grouping, and distribution — for example, splitting items evenly among teams, or determining the smallest shipment size that satisfies two different order quantities. Recognizing these as GCF or LCM problems in disguise is the key to solving them quickly.
Practice Problems
Work through these five problems in order. The first three are standard multiple-choice questions, and the last two are quantitative comparisons — both formats appear on the ISEE Upper Level. Remember: there is no penalty for guessing, so always eliminate what you can and select an answer.
Lesson Summary
You now have a complete toolkit for ISEE divisibility and factor problems. The divisibility rules for 2, 3, 4, 5, 6, 8, 9, and 10 let you test factors instantly using digit properties alone. Prime factorization breaks any number into its fundamental building blocks. From those building blocks, you can compute the GCF (shared primes at lowest powers) and LCM (all primes at highest powers). The factor-counting formula — multiply (exponent + 1) values — tells you exactly how many factors a number has without listing them.
For quantitative comparison questions, remember to test multiple values when variables are involved — if the relationship flips, choose (D). For standard problems, use process of elimination aggressively: apply a quick divisibility test to rule out answer choices before doing any heavy calculation. These strategies will save you valuable time and boost your accuracy across the Quantitative Reasoning section.