AI summary by TwinMind
Solving Seven - Numberphile
Numberphile
13m 3s
Introduction to Improved Divisibility Method
- Previous video on seven divisibility was popular, people approach speaker about it frequently
- Speaker thought invented better method, turns out already known (division graphs)
- New method works for really big numbers, provides remainder information
Demonstration with Large Number (3,714,289)
- Brady provides test number: 3,714,289
- Uses clock face with numbers 0-6 (seven positions)
- Process: start at leftmost digit (3), follow red arrows between digits
- Step-by-step walkthrough:
- Start at 3, red arrow to 2
- Add 7: goes around clock back to 2
- Red arrow to 6, add 1 → position 0
- Red arrow to 0, add 4 → position 4
- Red arrow to 5, add 1 → position 6, add 2 → position 1
- Red arrow, add 8: count 8 positions
- Red arrow, add final digit 9: count 9 positions
- Final position: 5
- Result: number has remainder 5 when divided by 7
- Verification: 3,714,289 - 5 = 3,714,284 (exactly divisible by 7)
Method Explanation and Construction
- Clock face starts at 0: positions 0,1,2,3,4,5,6
- Red arrows represent "multiply by 10" shortcuts
- Example calculations for shortcuts:
- 1×10 = 10 → remainder 3 (after dividing by 7)
- 2×10 = 20 → remainder 6
- 3×10 = 30 → remainder 2
- 4×10 = 40 → remainder 5
- 5×10 = 50 → remainder 1
- 6×10 = 60 → remainder 4
- 0×10 = 0 → remainder 0
Smaller Example (394)
- Demonstrates process: 3→2 (add 9)→4 (multiply by 10)→5 (add 4)→2
- Shows 394 has remainder 2 when divided by 7
Mental Arithmetic Version
- Can be done without visual aid
- Process: multiply by 10, add next digit, reduce if >7
- For 7: multiplying by 10 ≡ multiplying by 3 (modulo 7)
- Alternative: multiply by 3 and add next digit
Extension to Other Numbers
- Method works for any number, including "awkward" ones like 13
- Example: 13-position clock (0-12)
- Shortcut arrows calculated same way:
- 1→10, 2→7, 3→4, 5→11, 6→8, 7→5, 8→2, 9→12, 10→9, 11→6, 12→3
Division Graph for 9
- Demonstrates why "add digits" test works for 9
- All positions map back to themselves (1→1, 2→2, etc.)
- Explains mathematical reason behind digit-sum divisibility test
Practical Application
- Used to verify Matt Parker's hand-calculated π arithmetic
- More reliable than mental calculation alone
- Provides both divisibility and remainder information
