AI summary by TwinMind

The Reciprocals of Primes - Numberphile

Numberphile

15m 30s

William Shanks Background & Work

  • Mid to late 1800s mathematician, recreational mathematician with day job running boarding school
  • Sent handwritten calculation results to Royal Society
  • Calculated reciprocals of prime numbers by hand across multiple years
  • Worked in batches of 10 to 5000 at a time - very slow process
  • Results documented: prime numbers in left columns, number of digits in reciprocal periods in right columns

Reciprocal Calculation Method Demonstration

  • Example: Prime 6013 - reciprocal repeats after 5001 digits
  • Verification using "ShanksBot" Python software confirms accuracy
  • Manual demonstration using prime 7:
    • 1/7 = 0.142857... (repeats after 6 digits)
    • Long division process: 7 into 1, then 10, 30, 20, 60, 40, 10 (cycle)
    • Pattern: 1→4→2→8→5→7→ (repeat)

Long Division Process for Prime 23

  • Detailed walkthrough of 1/23 calculation
  • Created 23 times table for reference (23, 46, 69, 92, 115, 138, 161, 184, 207, 230)
  • Remainder sequence tracking: 1, 8, 11, 18, 19, 6, 14, 2, 16...
  • Key insight: remainders must be < 23 (can't be 0 or 23)
  • Maximum possible cycle length = n-1 digits (worst case scenario)

Mathematical Principles

  • All prime reciprocals eventually hit infinite loops
  • Remainders limited to values 1 through (prime-1)
  • Example: 60,017 hit maximum 60,016 digits (used every possible remainder)
  • Contrast: 6013 only used 5001 remainders (~10% of possible values)

Shanks' Methodology Analysis

  • Likely didn't use long division for large calculations (too time-consuming, paper-intensive)
  • Error patterns suggest different technique:
    • Systematic doubling/halving errors in corrections
    • 30,525 corrected to 61,050 (exactly double)
    • Implies method involving powers of 2 or halving steps

Historical Context & Legacy

  • Died 1882, still calculating primes up to 110,000 three years before death
  • Practical application noted: using prime reciprocals to find composite number reciprocals
  • No clear practical purpose stated beyond mathematical interest
  • Survived by wife who lived ~20 years after his death
  • Still holds world record for most digits of π calculated by hand

Advanced Mathematical Concepts

  • Primitive roots explanation:
    • Primes with 10 as primitive root use all possible remainders before repeating
    • 60,017 has 10 as primitive root (maximum cycle length)
    • 6013 doesn't have 10 as primitive root (shorter cycle)
  • Reptend primes: primes that achieve maximum reciprocal period length
  • Connection to composite number reciprocal calculations via least common multiples

TwinMind

Get summaries like this for your own meetings

TwinMind takes notes in the background during meetings, lectures, and calls, then writes the summary for you.

Free plan to get started

No bot joins your calls

Phone, desktop & Chrome apps

Your next meeting, summarized like this

TwinMind listens in the background and turns meetings, lectures, and calls into searchable notes you can chat with. Start free.

Available on phone, desktop & Chrome

Your next meeting, summarized like this

TwinMind listens in the background and turns meetings, lectures, and calls into searchable notes you can chat with. Start free.

Available on phone, desktop & Chrome

Your next meeting, summarized like this

TwinMind listens in the background and turns meetings, lectures, and calls into searchable notes you can chat with. Start free.

Available on phone, desktop & Chrome