AI summary by TwinMind

Erdős–Woods Numbers - Numberphile

Numberphile

14m 11s

Initial Problem Setup and Examples

  • Speaker demonstrates number game with sequence 24-35
  • Goal: cross off all numbers that share factors with endpoints (24 or 35)
  • 24 factors: 2, 3, 4... (even numbers, multiples of 3)
  • 35 factors: 5, 7
  • Process eliminates most numbers but 29 and 31 remain (both prime)
  • Problem: some sequences cannot be completely crossed off

Second Example: Sequence 114-126

  • Chosen to avoid primes in middle
  • 114 factors: 2, 3 (eliminates evens, multiples of 3)
  • 126 factors: 7 (eliminates multiples of 7)
  • Still gets stuck at 121 (11²)
  • Demonstrates difficulty of finding complete sequences

Erdős-Woods Numbers Discovery

  • Problem originated from mathematician Alan Woods
  • Woods initially thought complete elimination was impossible
  • First successful sequence: 2,184 to 2,200 (length 16)
  • 2,184 factors: 2, 3
  • 2,200 factors: 2, 5, 11, 13
  • All intermediate numbers eliminated using these prime factors

Known Erdős-Woods Numbers

  • First few lengths: 16, 22, 34, 36, 46, 56, 64
  • Starting points:
    • Length 16: 2,184
    • Length 22: 35,212,110
    • Length 34: 4,776,913,080,152,566
    • Length 36: 1,203,465,165,320 (smaller than length 34 start)
  • Most are even numbers
  • First odd Erdős-Woods number: 93
  • Infinitely many sequences exist for each valid length
  • Not all lengths possible (gaps exist in sequence)

Advanced Mathematical Context

  • Woods working on high-level prime number theory
  • Comparing prime divisors across different sequences of same length
  • Example: sequences 14-16 vs 224-226
    • 14 = 2×7, 224 = 2⁵×7 (same prime divisors)
    • 15 = 3×5, 225 = 3²×5² (same prime divisors)
    • 16 = 2⁴, 226 = 2×113 (different prime divisors)
  • Question: finite value k where all sequence pairs of length k must differ?
  • Conjecture: k=3 works for "most" cases (finitely many exceptions)
  • Longest known matching sequences: length 2 (fail at position 3)
  • No known sequences matching for 3+ positions

Open Mathematical Questions

  • Whether chains can overlap
  • Connection to unsolved high-level mathematical conjectures
  • Pushes limits of current mathematical knowledge

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