AI summary by TwinMind
343867 and Tetrahedral Numbers - Numberphile
Numberphile
12m 4s
Triangular Numbers Introduction
- Triangular numbers: numbers that can be arranged into triangle shape using tokens
- Examples: 3, 6, 10, 15, 21
- Sequence includes 1, 2 (though 2 doesn't look triangular)
- Pattern can be extended backwards
Gauss's Triangular Number Theorem
- Gauss and Euler loved triangular numbers
- Gauss proved famous triangular theorem
- Recorded excitement in diary: "Eureka! num = △ + △ + △" (in Greek)
- Every number can be written as sum of at most 3 triangular numbers
- Examples:
- 15: uses 1 triangle (15 itself)
- 16: uses 2 triangles (15+1 or 6+10)
- 17: uses 3 triangles (10+6+1 or 15+1+1)
- Some numbers need exactly 3 triangles, cannot be done with fewer
- Proof is long, involves algebra and number theory
- Was entire chapter in Gauss's textbook
Square Numbers (Four-Square Theorem)
- Square number sequence: 1, 4, 9, 16, 25...
- Proven 20 years before Gauss's triangular theorem
- Every positive whole number can be written with at most 4 squares
- Examples:
- 25: uses 1 square (25 itself)
- 26: uses 2 squares (25+1)
- 27: uses 3 squares (25+1+1 or 9+9+9)
- 28: uses 4 squares (25+1+1+1 or 9+9+9+1)
- Originally conjectured by Fermat without proof
Pentagon and Hexagon Numbers
- Pentagon numbers: 1, 5, 12, 22... (arranged in pentagon shapes)
- Hexagon numbers: 1, 6, 15, 28... (arranged in hexagon shapes)
- Built by adding layers to base shapes
- Brady's conjecture: 5 pentagons needed for any number, 6 hexagons for any number
Fermat's Polygonal Number Conjecture
- General conjecture: every positive whole number can be written with at most n n-gonal numbers
- Proven 15 years after Gauss's result by mathematician Cauchy
- Original proof was long and difficult
- Modern proof: only 3 pages using Gauss's Eureka theorem as foundation
Tetrahedral Numbers (3D Extension)
- Tetrahedral numbers: numbers forming triangular-based pyramids
- Sequence: 1, 4, 10, 20, 35...
- Brady's initial conjecture: 2n tetrahedrons needed
- Corrected to: tetrahedron is 4-sided solid
- Actual conjecture (Pollock's): at most 5 tetrahedral numbers needed
Pollock's Conjecture (Unproven)
- States: every whole number can be written with at most 5 tetrahedral numbers
- Appears true but unproven
- Checked for numbers in billions
- Largest known number needing 5 tetrahedrons: 343,867
- Most numbers after this use 4 or fewer tetrahedrons
- Evidence suggests conjecture is true as larger numbers seem easier
- Related fact: every number can be written as sum of 9 cubes (proven)
Jane Street Sponsor Segment
- New puzzle: "Bug Bite"
- Programs available for high school students, undergraduates, postgraduates, PhDs
- Opportunities to learn trading, computer problem-solving
- Career development possibilities
Encouragement for Mathematical Exploration
- Invitation to attempt proofs/conjectures
- Expectation that proofs will be difficult
- Value in discovery process even without complete proof
- Learning occurs through the journey of exploration
