AI summary by TwinMind
Faulhaber's Fabulous Formula (and Bernoulli Numbers) - Numberphile
Numberphile
15m 8s
Personal Mathematical Journey
- Speaker kept math journal as child with private mathematical musings
- First year at Princeton, asked professor about journal question
- Professor referred speaker to John Conway (speaker barely knew who he was at time)
- Conway looked at journal, introduced Faulhaber's fabulous formula and Bernoulli numbers
- This introduction led to speaker's current research area in number theory
- Meeting occurred beautiful spring day in 1999 (speaker journaled about it)
Power Sum Problem Introduction
- Core question: What is value of 1^k + 2^k + 3^k + ... + n^k for positive integer k?
- Example: n=100, k=2 gives 1² + 2² + 3² + ... + 100²
- k=0 case: 1⁰ + 2⁰ + 3⁰ + ... + n⁰ = n (all terms equal 1)
- k=1 case: 1 + 2 + 3 + ... + n = n(n+1)/2 (standard formula)
- Higher powers (squares, cubes, fourth powers) become increasingly difficult
- Traditional approaches become "just a mess" for cubes and beyond
Faulhaber's Fabulous Formula
- Formula solves power sum problem for any k
- Faulhaber looked at: 1^(k-1) + 2^(k-1) + 3^(k-1) + ... + n^(k-1)
- Equals: (1/k) × [(n+B)^k - B^k]
- B represents Bernoulli numbers in special notation
- Formula name likely coined by John Conway (appears in Conway & Guy's "Book of Numbers")
Bernoulli Numbers Definition and Computation
- B₀ = 1 (definition)
- Bₖ = Bᵏ (subscript equals superscript notation)
- For k > 1: (B-1)^k = B^k (defining rule)
- B₁ calculation:
- (B-1)² = B²
- B² - 2B + 1 = 0
- B₁ = 1/2
- B₂ calculation:
- (B-1)³ = B³
- -3B₂ + 3B₁ - 1 = 0
- B₂ = 1/6
Worked Example
- Computing 1² + 2² + ... + 100²
- k-1 = 2, so k = 3
- Formula: (1/3) × [(100+B)³ - B³]
- Expansion: 3B₂×100 + 3B₁×100² + 100³
- Substituting values: 3×(1/6)×100 + 3×(1/2)×100² + 100³
- Final computation possible with known Bernoulli numbers
Mathematical Derivation
- Key insight: (n+B)^k - (n+B-1)^k
- Using binomial theorem and Bernoulli number properties
- Most terms cancel due to rule (B-1)^k = B^k for k > 1
- Results in: k×n^(k-1) = (1/k)×[(n+B)^k - (n+B-1)^k]
- Telescoping sum gives Faulhaber's formula
Broader Mathematical Significance
- Bernoulli numbers appear in multiple mathematical contexts
- Connected to Euler's formula for Riemann zeta function at positive even integers
- Encode deep number theory information
- Connect elementary problem to advanced mathematical phenomena
- Demonstrate how simple questions lead to profound mathematics
