SECTION 1
Historical Context & Motivation
Have you ever looked at a big number like 4,572 and wondered, "Can I split this evenly into groups of 3?" People have been asking questions like that for thousands of years. Long before calculators existed, mathematicians invented clever shortcuts called divisibility rules. These rules let you check whether one number divides into another without doing the full division.
~300 BCE • Euclid's Elements
~500 CE • Indian Mathematicians
1202 • Fibonacci Spreads the System
1801 • Gauss & Modular Arithmetic
Today, divisibility rules are still super useful — especially on timed tests like the SHSAT. They help you simplify fractions, find factors, and solve problems faster. The big question is: how can you tell if a number is divisible by 2, 3, 4, 5, 6, 8, 9, or 10 just by looking at its digits?
SECTION 2
Core Principles & Definitions
Before we dive into the rules, let's make sure we understand the key vocabulary. When we say a number is divisible by another number, we mean it divides evenly with no remainder. For example, 12 is divisible by 3 because 12 ÷ 3 = 4 exactly. But 13 is not divisible by 3 because 13 ÷ 3 = 4 with a remainder of 1.
Divisibility
Factor
Multiple
Remainder
KEY TAKEAWAY
SECTION 3
Visual Explanation — The Divisibility Rules Chart
The diagram below shows the most important divisibility rules you need for the SHSAT. Each rule tells you exactly which digits to look at and what to check. Study this chart — it's your cheat sheet!
Look at how the rules fall into two groups. The first group (for 2, 5, and 10) only cares about the last digit. The second group (for 3 and 9) asks you to add up all the digits. The rules for 4, 6, and 8 combine ideas from these two groups. Knowing which group a rule belongs to makes it much easier to remember.
SECTION 4
Mathematical Framework — Why the Rules Work
You might wonder: why does adding digits tell you about divisibility by 3? It's not magic — it's math! Let's see the reasoning behind the most-tested rules.
Divisibility by 2
RULE FOR 2
Why? Every number can be written as (some amount × 10) + last digit. Since 10 is always divisible by 2, we only need to check the last digit.
Divisibility by 3
RULE FOR 3
Example: For 531, add 5 + 3 + 1 = 9. Since 9 ÷ 3 = 3 (no remainder), 531 is divisible by 3.
Divisibility by 9
RULE FOR 9
This works for the same reason as the rule for 3, but with a stricter requirement. For 531, the digit sum is 9, and 9 ÷ 9 = 1, so 531 is also divisible by 9.
Divisibility by 4
RULE FOR 4
Why two digits? Because 100 is divisible by 4, so any hundreds, thousands, etc. are already taken care of. Only the last two digits matter. Example: 916 → last two digits are 16. Since 16 ÷ 4 = 4, the number 916 is divisible by 4.
SHSAT Tip
SECTION 5
Detailed Breakdown — Testing the Number 2,340
Let's put all the rules to work on a single number: 2,340. The diagram below walks through every divisibility check. This is the kind of systematic thinking that saves time on the SHSAT.
| Divisor | What to Check | Result for 2,340 |
|---|---|---|
| 2 | Last digit is even | 0 is even → ✓ |
| 3 | Digit sum divisible by 3 | 9 ÷ 3 = 3 → ✓ |
| 4 | Last two digits divisible by 4 | 40 ÷ 4 = 10 → ✓ |
| 5 | Last digit is 0 or 5 | Ends in 0 → ✓ |
| 6 | Divisible by both 2 and 3 | Both pass → ✓ |
| 8 | Last three digits divisible by 8 | 340 ÷ 8 = 42.5 → ✗ |
| 9 | Digit sum divisible by 9 | 9 ÷ 9 = 1 → ✓ |
| 10 | Last digit is 0 | Ends in 0 → ✓ |
Divisibility results for 2,340
SECTION 6
Worked Example — SHSAT-Style Problem
Let's walk through a problem like one you might see on the actual SHSAT. Pay attention to each step — the method matters as much as the answer.
Which of the following numbers is divisible by both 4 and 9: 1,224 or 1,242?
- 1
Step 1 — Check 1,224 for divisibility by 4
Look at the last two digits of 1,224. They form the number 24. Is 24 divisible by 4? Yes, because 24 ÷ 4 = 6.1,224 passes the test for 4 ✓ - 2
Step 2 — Check 1,224 for divisibility by 9
Add all the digits: 1 + 2 + 2 + 4 = 9. Is 9 divisible by 9? Yes, because 9 ÷ 9 = 1.1,224 passes the test for 9 ✓ - 3
Step 3 — Conclusion for 1,224
Since 1,224 is divisible by both 4 and 9, we already have our answer. But let's check 1,242 anyway for practice.1,224 is divisible by both 4 and 9 ✓ - 4
Step 4 — Check 1,242 for divisibility by 4
Look at the last two digits: 42. Is 42 divisible by 4? Let's check: 42 ÷ 4 = 10.5. That's not a whole number.1,242 fails the test for 4 ✗ - 5
Step 5 — Final Answer
Since 1,242 is NOT divisible by 4, it can't be divisible by both 4 and 9. The answer is 1,224.Answer: 1,224
Time-Saving Strategy
SECTION 7
Strengths & Limitations of Divisibility Rules
Divisibility rules are powerful, but they have limits. Knowing when they work well — and when they don't — will help you use them wisely on test day.
| Strengths | Limitations |
|---|---|
| No calculator needed — just look at digits or add them. | No simple rule exists for 7 that's easy to remember. |
| Very fast for 2, 5, and 10 (just check the last digit). | For very large numbers, the rule for 8 (check last 3 digits) can still require mental division. |
| The rule for 6 combines two simpler rules, making it easy to apply. | Rules don't directly tell you the quotient — only whether division is even. |
| Helps you simplify fractions quickly by finding common factors. | Doesn't work well for prime divisors larger than 10 (like 11 or 13). |
Strengths vs. Limitations of Divisibility Rules
KEY TAKEAWAY
SECTION 8
Connection to Advanced Topics
Divisibility rules are your first step into a bigger world of number theory. Here's how the ideas you've learned connect to topics you'll see in high school and beyond.
| What You Know Now | Where It Leads |
|---|---|
| Divisibility by 2, 3, 4, etc. | Prime Factorization — breaking a number into its smallest factor building blocks. |
| Checking if remainder is 0 | Modular Arithmetic — a system that focuses entirely on remainders. Used in computer science and cryptography. |
| Finding common factors of two numbers | GCF and LCM — Greatest Common Factor and Least Common Multiple, essential for simplifying fractions and solving equations. |
| Digit-sum rules for 3 and 9 | Casting Out Nines — an old technique for checking arithmetic, based on the same digit-sum idea. |
From divisibility rules to advanced math
On the SHSAT specifically, divisibility rules often appear in questions about factors, multiples, and simplifying fractions. Mastering these rules now gives you a strong foundation for GCF/LCM problems, which are also tested. The same logical thinking — breaking a problem into smaller checks — will help you in algebra and beyond.
SECTION 9
Practice Problems
Question 1: CONCEPTUAL
Show answer
Question 2: BASIC CALCULATION
Show answer
Question 3: INTERMEDIATE
Show answer
Question 4: APPLIED
Show answer
Question 5: CRITICAL THINKING
Show answer
SUMMARY
Lesson Summary
Summary
Divisibility rules are shortcuts that let you check whether a number divides evenly by 2, 3, 4, 5, 6, 8, 9, or 10 — without doing long division. For 2, 5, and 10, you only need to look at the last digit. For 3 and 9, you add all the digits and check whether that sum is divisible by 3 or 9. For 4 and 8, check the last two or three digits. The rule for 6 is a combo — the number must pass both the test for 2 and the test for 3.
On the SHSAT, these rules save you valuable time. Use them to simplify fractions, find factors, and eliminate wrong answer choices quickly. Remember: a number that is divisible by a product (like 6 = 2 × 3) must be divisible by each of its factors. Master these rules, and you'll handle number-properties questions with confidence.