Apply divisibility rules to evaluate expressions.

SECTION 1

Historical Context & Motivation

Ancient mathematicians faced challenges dividing large numbers by hand, which took considerable time and effort during calculations. Divisibility rules emerged as efficient shortcuts, allowing quick determination if one number divides another evenly. These rules trace back to early number theory, solving real-world problems in commerce and astronomy. Today, they help SSAT students evaluate expressions rapidly without calculators.

300 BCE

Euclid's Elements

Euclid documents basic divisibility properties in Elements, laying groundwork for modular arithmetic.

1801

Gauss's Disquisitiones

Carl Friedrich Gauss advances rules for primes like 7 and 13 in his foundational number theory text.

19th Century

Widespread Use

Rules for 2, 3, 5, 9 become standard in education, speeding computations before calculators.

Today

SSAT Application

Used to evaluate if expressions like large factorials divided by primes yield integers.

These rules address the core question: how can you confirm divisibility for huge numbers or expressions without performing full division, saving time on timed tests like the SSAT?

SECTION 2

Core Principles & Definitions

A number is divisible by another if the remainder is zero upon division, equivalent to congruence modulo that divisor. Divisibility rules exploit patterns in base-10 representation for quick checks. They rely on properties like 10 ≡ 1 mod 9, making digit sums effective. You can apply these to simplify expressions, determining integer results instantly.

Rule for 2

Last digit even (0,2,4,6,8).

Rule for 3

Sum of digits divisible by 3.

Rule for 5

Ends in 0 or 5.

Rule for 9

Sum of digits divisible by 9.

Rule for 11

Alternating sum of digits divisible by 11.

✦ Quick Analogy

Think of divisibility rules like a car's license plate check: glance at the last digit for even or 5-ending to spot highway eligibility fast, without a full test drive.

SECTION 3

Visual Explanation of Rules

This chart visualizes key rules with color-coded boxes; arrows would connect composite rules in full flow.

The diagram groups rules by ease of application, starting with single-digit checks like for 2 and 5, progressing to sums for 3 and 9. Notice how rules for composites build on basics, such as 6 requiring both 2 and 3. This visual aids memory for evaluating expressions on the SSAT. Practice spotting patterns to build speed and confidence.

SECTION 4

Mathematical Framework

Divisibility rules stem from modular arithmetic, where a number n is divisible by d if n ≡ 0 (mod d). For base 10, powers of 10 have specific residues, enabling digit-based tests. Key: 10 ≡ 0 (mod 2,5,10), 10 ≡ 1 (mod 9,3). These allow evaluating expressions like (large number)/d without computation.

RULE FOR 3 & 9

Sum of digits S(n) ≡ n (mod 9), so if S(n) ≡ 0 (mod 9) then n ≡ 0 (mod 9)

Repeat summing until single digit (digital root). For 3, mod 3 instead.

RULE FOR 11

Alternating sum A(n) = d₀ − d₁ + d₂ − d₃ + ⋯ ≡ n × (10⁰ − 10¹ + 10² − ⋯) (mod 11)

Since 10 ≡ −1 (mod 11), A(n) ≡ n (mod 11).

COMPOSITES

For 6: Check 2 and 3; for 12: Check 4 and 3

SECTION 5

Detailed Rule Breakdown

Flowchart demonstrates applying rules for 6 on 123456, confirming divisibility through both 2 and 3 checks.

This breakdown shows how to chain rules for composites, first verifying simpler conditions before complex ones. For expressions, test numerator divisibility by denominator's factors. The visual path reinforces logical order, essential for multi-step SSAT problems. Mastering this builds efficiency and reduces errors.

SECTION 6

Worked Example: Evaluate Expression

Consider the expression (38165472 ÷ 9). Does it yield an integer? Apply rules step-by-step to confirm without dividing.

Is 38165472 ÷ 9 an integer?

Step 1: Sum digits3+8+1+6+5+4+7+2 = 36

Step 2: Check sum mod 93+6=9, 9 ÷9=1 (exact) or 36 ≡ 0 (mod 9)

Yes

Conclusion38165472 ≡ 0 (mod 9), so divides evenly. Quotient: 4240608.

Integer ✓

SECTION 7

Strengths, Limitations & Comparisons

Comparison highlights when to use each rule efficiently.

Rule	Strength	Limitation
2,5,10	Instant last-digit check.	Only for these divisors.
3,9	Works for any size via summing.	Requires full sum first.
11	Precise for alternating.	Multi-step alternating sum.

✦ KEY TAKEAWAY

Rules shine for quick no-calc checks but pair with prime factorization for unknowns; like using a map before GPS for navigation.

SECTION 8

Connection to Advanced Theory

Basic Rules	Advanced Modular
Digit sums for 3/9	n ≡ S(n) (mod 9)
Last two for 4	100n + m ≡ m (mod 4)
Limited primes	General Fermat/ Euler theorems

These rules preview modular arithmetic, used in cryptography and computing. On SSAT, they suffice, but understanding congruences prepares for higher math like number theory proofs.

SECTION 9

Practice Problems

PROBLEM 1 — CONCEPTUAL

Which rule checks divisibility by 4 using the fewest digits? A. Last digit even B. Sum of all digits ÷4 C. Last two digits ÷4 D. Alternating sum ÷4 E. Last three digits ÷4

PROBLEM 2 — BASIC CALCULATION

Is 7425 divisible by 5? A. Yes B. No C. Check sum D. Check last two E. Check alternating

PROBLEM 3 — INTERMEDIATE

Is 148593 divisible by 9? A. Yes (sum=39, 3+9=12) B. No (sum=39, not ÷9) C. Yes (last=3) D. No (odd) E. Check 11

PROBLEM 4 — APPLIED

Which expression yields integer? (Assume no calc) A. 123456 / 7 B. 999999 / 9 C. 1001 / 4 D. 24680 / 6 E. 13579 / 3

PROBLEM 5 — CRITICAL THINKING

For n=10¹⁰ + 2, is n/3 integer? A. Yes (ends 2) B. No (sum huge) C. Yes (sum=1+0*9+2=3÷3) D. No (10≡1 mod3, so 1+2=3≡0) E. Check 11

SUMMARY

Lesson Summary

Divisibility rules let you evaluate expressions like large quotients instantly by checking patterns in digits. Key rules: 2(even), 3/9(sum), 5(0/5), 11(alt sum), chain for composites.

Practice chaining on SSAT problems boosts speed; rooted in modular arithmetic, they prepare for advanced math. You're now equipped to tackle any divisibility challenge confidently!