|
|
1 | (18) |
|
1.1 Human conception of numbers |
|
|
1 | (3) |
|
1.2 Algebraic Number Systems |
|
|
4 | (1) |
|
1.3 New Numbers, New Worlds |
|
|
5 | (8) |
|
|
13 | (6) |
|
|
18 | (1) |
|
2 A Quick Survey of the Last Two Millennia |
|
|
19 | (18) |
|
2.1 Fermat, Wiles, and The Father of Algebra |
|
|
19 | (2) |
|
|
21 | (6) |
|
2.3 Diophantine Equations |
|
|
27 | (6) |
|
|
33 | (4) |
|
|
35 | (2) |
|
3 Number Theory in Z Beginning |
|
|
37 | (42) |
|
|
37 | (7) |
|
3.2 Linear Diophantine Equations and the Euclidean Algorithm |
|
|
44 | (13) |
|
3.3 The Fundamental Theorem of Arithmetic |
|
|
57 | (6) |
|
3.4 Factors and Factorials |
|
|
63 | (7) |
|
3.5 The Prime Archipelago |
|
|
70 | (3) |
|
|
73 | (6) |
|
4 Number Theory in the Mod-n Era |
|
|
79 | (58) |
|
4.1 Equivalence Relations and the Binary World |
|
|
79 | (5) |
|
4.2 The Ring of Integers Modulo n |
|
|
84 | (4) |
|
4.3 Reduce First and ask Questions Later |
|
|
88 | (5) |
|
4.4 Division, Exponentiation, and Factorials in Z/(n) |
|
|
93 | (7) |
|
4.5 Group Theory and the Ring of Integers Modulo n |
|
|
100 | (8) |
|
4.6 Lagrange's Theorem and the Euler Totient Function |
|
|
108 | (10) |
|
4.7 Sunzi's Remainder Theorem and φ(n) |
|
|
118 | (7) |
|
4.8 Phis, Polynomials, and Primitive Roots |
|
|
125 | (3) |
|
|
128 | (9) |
|
5 Gaussian Number Theory: Z[ i] of the Storm |
|
|
137 | (34) |
|
|
137 | (1) |
|
5.2 Gaussian Divisibility |
|
|
138 | (6) |
|
5.3 Gaussian Modular Arithmetic |
|
|
144 | (3) |
|
5.4 Gaussian Division Algorithm: The Geometry of Numbers |
|
|
147 | (4) |
|
5.5 A Gausso-Euclidean Algorithm |
|
|
151 | (4) |
|
5.6 Gaussian Primes and Prime Factorizations |
|
|
155 | (5) |
|
5.7 Applications to Diophantine Equations |
|
|
160 | (5) |
|
|
165 | (6) |
|
6 Number Theory, from Where We R to Across the C |
|
|
171 | (38) |
|
|
171 | (3) |
|
6.2 Algebraic Numbers and Rings of Integers |
|
|
174 | (6) |
|
6.3 Quadratic Fields: Integers, Norms, and Units |
|
|
180 | (6) |
|
|
186 | (6) |
|
6.5 Unique Factorization Domains |
|
|
192 | (3) |
|
6.6 Euclidean Rings of Integers |
|
|
195 | (10) |
|
|
205 | (4) |
|
7 Cyclotomic Number Theory: Roots and Reciprocity |
|
|
209 | (36) |
|
|
209 | (2) |
|
7.2 Quadratic Residues and Legendre Symbols |
|
|
211 | (3) |
|
7.3 Quadratic Residues and Non-Residues Mod p |
|
|
214 | (2) |
|
7.4 Application: Counting Points on Curves |
|
|
216 | (4) |
|
7.5 The Quadratic Reciprocity Law: Statement and Use |
|
|
220 | (3) |
|
7.6 Some Unexpected Helpers: Roots of Unity |
|
|
223 | (5) |
|
7.7 A Proof of Quadratic Reciprocity |
|
|
228 | (9) |
|
|
237 | (3) |
|
|
240 | (5) |
|
8 Number Theory Unleashed: Release Zp! |
|
|
245 | (54) |
|
8.1 The Analogy between Numbers and Polynomials |
|
|
245 | (4) |
|
8.2 The p-adic World: An Analogy Extended |
|
|
249 | (6) |
|
8.3 p-adic Arithmetic: Making a Ring |
|
|
255 | (7) |
|
8.4 Which numbers are p-adic? |
|
|
262 | (4) |
|
|
266 | (7) |
|
8.6 The Local-Global Philosophy and the Infinite Prime |
|
|
273 | (4) |
|
8.7 The Local-Global Principle for Quadratic Equations |
|
|
277 | (8) |
|
8.8 Computations: Quadratic Equations Made Easy |
|
|
285 | (5) |
|
8.9 Synthesis and Beyond: Moving Between Worlds |
|
|
290 | (3) |
|
|
293 | (6) |
|
9 The Adventure Continues |
|
|
299 | (56) |
|
9.1 Exploration: Fermat's Last Theorem for Small n |
|
|
301 | (7) |
|
9.2 Exploration: Lagrange's Four-Square Theorem |
|
|
308 | (10) |
|
9.3 Exploration: Public Key Cryptography |
|
|
318 | (17) |
|
9.3.1 Public Key Encryption: RSA |
|
|
320 | (5) |
|
9.3.2 Elliptic Curve Cryptography |
|
|
325 | (8) |
|
9.3.3 Elliptic ElGamal Public Key Cryptosystem |
|
|
333 | (2) |
|
9.4 Exploration: Units of Real Quadratic Fields |
|
|
335 | (7) |
|
9.5 Exploration: Ideals and Ideal Numbers |
|
|
342 | (11) |
|
9.6 Conclusion: The Numberverse, Redux |
|
|
353 | (2) |
Appendix I Number Systems |
|
355 | (10) |
Index |
|
365 | (6) |
Index of Notation |
|
371 | |