AI summary by TwinMind
Paterson Primes (with 3Blue1Brown) - Numberphile
Numberphile
10m 34s
Patrick Paterson's Prime Method Origin
- Grant's high school friend Patrick Paterson claimed method for generating arbitrarily large primes
- Method: Convert prime to base 4, then read result as base 10 number
- Example with 17: 17 in base 4 = 101, which is also prime in base 10
Method Examples and Initial Success
- Multiple examples tested:
- 3 → 3 (prime)
- 5 → 11 (prime)
- 7 → 13 (prime)
- 11 → 23 (prime)
- Pattern appeared to work consistently for small primes
- Method seemed to generate new primes from existing ones
Pattern Breakdown Discovery
- Testing 101 (generated from 17): 101 base 4 = 1×64 + 2×16 + 1×4 + 1×1 = 1211 base 10
- 1211 = 7 × 173 (not prime)
- Pattern breaks down for larger numbers
- Before programming era, students couldn't easily verify large numbers
Mathematical Explanation - Divisibility Rules
- Method guarantees immunity from certain prime factors:
- Divisibility by 2: Base 4 even numbers end in 0 or 2, so odd primes remain odd
- Divisibility by 3: Same digit-sum rule applies in base 4 as base 10
- 10 ≡ 1 (mod 3), so digit sum determines divisibility
- Operations (addition/multiplication) commute with modular reduction
- Divisibility by 5: No digit 5 exists in base 4, and ending in 0 means even
- First available prime divisor becomes 7
Small Numbers Advantage
- Up to 49: immunity from 2, 3, 5 sufficient to guarantee primality
- 49 = first composite with all prime factors > 5
- Beyond 49: random whether hits divisors like 7, 11, 13
- Examples of continued success: 5→11→23→113
Richard Guy's Strong Law of Small Numbers
- Small numbers can't support weight of all patterns expected
- Coincidences inevitable in small number ranges
- Explains why Paterson method initially appeared successful
Statistical Analysis
- First 1000 primes tested using Paterson method
- Only 388 of 1000 pass the primality test
- Pattern starts strong but tails off significantly
- Confirms no factors of 2, 3, or 5 in any results
