Using calculus to do number theory
This article masterfully bridges the seemingly disparate worlds of continuous calculus and discrete number theory, demonstrating how a classical calculus technique, Newton's method, can be repurposed to solve complex problems in modular arithmetic. It delves into Hensel's remarkable discovery, showing how to iteratively refine solutions for polynomial congruences. The piece is popular on HN for its elegant exposition of advanced mathematical concepts and its revelation of unexpected connections within mathematics, leading to the profound Langlands program.
The Lowdown
The article explores the surprising connection between calculus, the mathematics of continuous approximations, and number theory, which deals with exact problems concerning discrete quantities. It introduces Kurt Hensel's groundbreaking insight: applying calculus-like ideas to better understand number theory problems, specifically focusing on solving polynomial equations in modular arithmetic.
- The main problem posed is finding integer solutions for x^3 - 17x^2 + 12x + 16 ≡ 0 (mod 3000).
- Using the Chinese Remainder Theorem, the problem is reduced to solving three separate congruences: modulo 2^3 (8), modulo 3, and modulo 5^3 (125).
- The solutions for modulo 8 (x ≡ 0, 4 (mod 8)) and modulo 3 (x ≡ 1 (mod 3)) are found by brute-force checking a small number of values.
- Solving modulo 125 by brute force is impractical, leading to the core challenge the article addresses.
- The approach starts by solving modulo 5, yielding x ≡ 2 (mod 5). When x=2 is plugged into the polynomial, f(2) = -20, which is divisible by 5 but not 125. Hensel considered this 'close' to zero.
- A crucial digression explains Newton's method from calculus: approximating a function g(x+epsilon) as g(x) + g'(x) * epsilon to find better approximations for roots.
- Hensel's key insight was applying a modular equivalent of Newton's method. For a solution x ≡ 2 (mod 5), write x = 2 + 5n. Hensel showed that f(2+5n) ≡ f(2) + f'(2) * 5n (mod 25).
- The article then demonstrates the iterative process: using f(2) = -20 and f'(2) ≡ 6 (mod 25), it solves for n, yielding x ≡ 22 (mod 25).
- This process is repeated to upgrade the solution from modulo 25 to modulo 125, resulting in x ≡ 72 (mod 125).
- The article concludes this section by highlighting that calculus tools enabled the solution of a number theory problem.
- Finally, an appendix briefly discusses the broader implications. This procedure, known as Hensel's Lemma, reduces finding solutions modulo p^e to finding solutions modulo p. The question of when f(x) ≡ 0 (mod p) has solutions connects to the Galois group of f(x) and ultimately leads to the advanced Langlands program in modern number theory.