数学的100个基本问题(新版) (靳平李秀萍郝水平)（Z-Library）

# Reading Guide: 数学的100个基本问题 (100 Basic Problems in Mathematics, New Edition) ## 【One-Line Pitch】 A curated tour of 100 classic mathematical problems—spanning number theory, algebra, geometry, and analysis—each presented with historical context and elegant proofs, ideal for high school and early university students who want to see how mathematicians think. ## 【Book Arc】 - **Opening (~0%–10%)**: The book opens with the preface explaining its mission—to showcase "basic" problems that are actually famous, historically significant theorems and conjectures. It begins with the Fundamental Theorem of Arithmetic, establishing the tone: clear statements, historical background, and rigorous elementary proofs. - **Early (~10%–25%)**: The number theory section deepens with problems on Fermat numbers, perfect numbers, prime-generating polynomials, and the Pythagorean equation. Readers encounter the Euclid–Euler theory of even perfect numbers and the full solution to x² + y² = z². - **Middle (~25%–50%)**: The book tackles Fermat's Last Theorem for exponent 3, presenting Gauss's proof via complex integers (Eisenstein integers). This is the technical heart of the early section, introducing norms, prime elements, and unique factorization in a new number system. Wilson's theorem and Euler's totient function follow with elegant congruence-based proofs. - **Late (~50%–75%)**: The text continues through quadratic residues and Euler's criterion, moving into further number-theoretic tools such as primitive roots. The pattern holds: each problem is a gateway to a broader concept. - **Ending (~75%–100%)**: The remaining sections cover algebra, combinatorics, geometry, topology, analysis, and set theory/history problems. The excerpts do not detail these later chapters, but the structure suggests a similar blend of famous results, historical narrative, and accessible proofs. ## 【Key Takeaways】 - **The "basic" label is deceptive** (Opening): These are not simple exercises but celebrated problems—Fermat's Last Theorem, Goldbach's conjecture, the four-color problem—chosen for their simple statements and elementary or ingenious proofs. The authors explicitly warn readers not to waste time attacking the great unsolved conjectures with elementary tools. - **Prime numbers are the atoms of arithmetic** (Early): The Fundamental Theorem of Arithmetic—every integer >1 factors uniquely into primes—is the logical foundation of number theory. Its uniqueness proof via Euclid's algorithm and the key lemma (if p divides ab, then p divides a or b) exemplifies the precision required in mathematical reasoning. - **Perfect numbers are tied to Mersenne primes** (Early): Euclid showed that if 2ᵖ−1 is prime, then 2ᵖ⁻¹(2ᵖ−1) is perfect; Euler proved the converse for even perfect numbers. Thus the open question of whether infinitely many perfect numbers exist reduces to the infinitude of Mersenne primes—and whether any odd perfect number exists remains a mystery (any such number must exceed 10³⁰⁰). - **Generalizing can simplify** (Middle): Gauss proved the n=3 case of Fermat's Last Theorem by moving from integers to the larger ring of complex integers a + bω (ω a primitive cube root of unity). This illustrates a deep mathematical principle: proving a more general statement is sometimes easier than proving a special case. - **Wilson's theorem is a theoretical primality test** (Middle): A number p is prime if and only if (p−1)! ≡ −1 (mod p). The proof pairs numbers 2 through p−2 into inverse pairs modulo p—a beautiful, short argument. However, the theorem is impractical for large p because factorials grow too fast. - **Euler's totient function generalizes Fermat's little theorem** (Middle): φ(n) counts integers less than n and coprime to n. Euler proved that a^φ(n) ≡ 1 (mod n) for gcd(a,n)=1, which reduces to Fermat's little theorem when n is prime. The proof is surprisingly simple: multiplying the reduced residue system by a permutes it. - **Quadratic residues have a clean criterion** (Middle): Euler's criterion states that a is a quadratic residue modulo an odd prime p if and only if a^((p−1)/2) ≡ 1 (mod p). This reduces the solvability of x² ≡ a (mod p) to a single modular exponentiation, and the proof via primitive roots is both elegant and instructive. ## 【Reading Tips】 - **Skim the historical prefaces** (Opening): The front matter explains the book's philosophy and warns against chasing famous unsolved problems. Read it once to calibrate expectations, then move to the mathematics. - **Deep-read the proof of the Fundamental Theorem of Arithmetic** (Early, ~3%): This sets the standard for rigor throughout. Master the lemma "if p divides ab then p divides a or b"—it reappears constantly, including in the complex integer setting later. - **Work through the Pythagorean triple derivation** (Early, ~19%): The full solution to x² + y² = z² is a model of elementary number theory. Try deriving the parametrization yourself before reading the book's version. - **Expect a challenge with Gauss's proof for exponent 3** (Middle, ~23%–39%): The complex integer framework (norms, prime elements, unique factorization) is dense. Read slowly, and don't worry if you need multiple passes—this is the book's most technically demanding stretch. - **Use the problems as a springboard** (Throughout): Each entry is self-contained. If a topic fascinates you (e.g., perfect numbers, quadratic residues), follow the references or explore further—the book is designed to spark curiosity, not exhaust it. ## 【Coverage Limits】 This guide is based on excerpts covering roughly the first half of the book (number theory problems 001–018). The later sections on algebra, combinatorics, geometry, topology, analysis, and set theory are not represented in the source material and are therefore not summarized here. ##