
| 本书是数论领域的一部传世名著,也是现代数学大师哈代的代表作之一。自出版以来一直备受学界推崇,被很多知名大学,如牛津大学、麻省理工学院 、加州大学伯克利分校等指定为教材或参考书,也是美国斯坦福大学每个数学与计算机科学专业学生必读的一本书。 |
| G.H.Hardy(1877-1947 ) 20世纪上半叶享有世界声誉的数学大师,是英国数学界和英国分析学派的领袖,对数论和分析学的发展有巨大的贡献和重大的影响。除了自己的研究工作之外,他还培养和指导了众多数学大家,包括印度数学奇才拉马努金和我国数学家华罗庚。 E.M.Wright (1906-2005 ) 英国著名数学家,毕业于牛津大学,是G.H.Hardy的学生。 生前担任英国名校阿伯丁大学校长多年。爱丁堡皇家学会会士、伦敦数学会会士。曾任Journal of Graph Theory 和Zentralblatt für Mathematik的.. << 查看详细 |
| i. the series of primes (1) 1.1. divisibility of integers 1.2. prime numbers 1.3. statement of the fundamer/tal theorem of arithmetic 1.4. the sequence of primes 1.5. some questions concerning primes 1.6. some notations 1.7. the logarithmic function 1.8. statement of the prime number theorem ii. the series of primes (2) 2.1. first proof of euclid's second theorem 2.2. further deductions from euclid's argument 2.3. primes in certain arithmetical progressions 2.4. second proof of euclid's theorem 2.5. fermat's and mersenne's numbers 2.6. third proof of euclid's theorem 2.7. further remarks on formulae for primes 2.8. unsolved problems concerning primes 2.9. moduli of integers 2.10. proof of the fundamental theorem of arithmetic .2.11. another proof of the fundamental theorem iii. farey series and a theorem of minkowski 3.1. the definition and simplest properties of a farey series 3.2. the equivalence of the two characteristic properties 3.3. first proof of theorems 28 and 29 3.4. second proof of the theorems 3.5. the integral lattice 3.6. some simple properties of the fundamental lattice 3.7. third proof of theorems 28 and 29 3.8. the farey dissection of the continuum 3.9. a theorem of minkowski 3.10. proof of minkowski's theorem 3.11. developments of theorem 37 iv. irrational numbers 4.1. some generalities 4.2. numbers known to be irrational 4.3. the theorem of pythagoras and its generalizations 4.4. the use of the fundamental theorem in the proofs of theorems 43-45 4.5. a historical digression 4.6. geometrical proof of the irrationality of √5 4.7. some more irrational numbers v. congruences and residues 5.1. highest common divisor and least common multiple 5.2. congruences and classes of residues 5.3. elementary properties of congruences 5.4. linear congruences 5.5. euler's function ~b(m) 5.6. applications of theorems 59 and 61 to trigonometrical sums 5.7. a general principle 5.8. construction of the regular polygon of 17 sides vi. fermat's theorem and its consequences 6.1. fermat's theorem 6.2. some properties of binomial coefficients 6.3. a second proof of theorem 72 6.4. proof of theorem 22 6.5. quadratic residues 6.6. special cases of theorem 79: wilson's theorem 6.7. elementary properties of quadratic residues and non-residues 6.8. the order of a (rood m) 6.9. the converse of fermat's theorem 6.10. divisibility of 2p-1 1 by p2 6.11. gauss's lemma and the quadratic character of 2 6.12. the law of reciprocity 6.13. proof of the law of reciprocity 6.14. tests for primality 6.15. factors of mersenne numbers; a theorem of euler vii. general properties of congruences 7.1. roots of congruences 7.2. integral polynomials and identical congruences 7.3. divisibility of polynomials (mod m) 7.4. roots of congruences to a prime modulus 7.5. some applications of the general theorems 7.6. lagrange's proof of fermat's and wilson's theorems 7.7. the residue of {1/2(p-1 )} ! 7.8. a theorem of wolstenholme 7.9. the theorem of yon staudt 7.10. proof of yon staudt's theorem viii. congruences to composite moduli 8.1. linear congruences 8.2. congruences of higher degree 8.3. congruences to a prime-power modulus 8.4. examples 8.5. bauer's identical congruence 8.6. bauer's congruence: the case p=2 8.7. a theorem of leudesdorf 8.8. further consequences of bauer's theorem 8.9. the residues of 2p-l and (p-1)! to modulus pz ix. the representation of numbers by decimals 9.1. the decimal associated with a given number 9.2. terminating and recurring decimals 9.3. representation of number8 in other scales 9.4. irrationals defined by decimals 9.5. tests for divisibility 9.6. decimals with the maximum period 9.7. bachet's problem of the weights 9.8. the game of nim 9.9. integers with missing digits 9.10. sets of measure zero 9.11. decimals with missing digits 9.12. normal numbers 9.13. proof that almost all numbers are normal x. continued fractions 10.1. finite continued fractions 10.2. convergents to a continued fraction 10.3. continued fractions with positive quotients 10.4. simple continued fractions 10.5. the representation of an irreducible rational fraction by a simple continued fraction 10.6. the continued fraction algorithm and euclid's algorithm 10.7. the difference between the fraction and its convergents 10.8. infinite simple continued fractions 10.9. the representation of an irrational number by an infinite continued fraction 10.10. a lemma 10.11. equivalent numbers 10.12. periodic continued fractions 10.13. some special quadratic surds 10.14. the series of fibonacci and lucas 10.15. approximation by convergents xi. approximation of irrationals by rationals 11.1. statement of the problem 11.2. generalities concerning the problem 11.3. an argument of dirichlet 11.4. orders of approximation 11.5. algebraic and transcendental numbers 11.6. the existence of transcendental numbers 11.7. liouville's theorem and the construction of transcendental numbers 11.8. the measure of the closest approximations to an arbitrary irrational 11.9. another theorem concerning the convergents to a continued fraction 11.10. continued fractions with bounded quotients 11.11. further theorems concerning approximation 11.12. simultaneous approximation 11.13. the transcendence of e 11.14. the transcendence of ∏ x ii. the fundamental theorem of arithmetic in k(l), k( i ) , and k(p ) 12.1. algebraic numbers and integers 12.2. the rational integers, the gaussian integers, and the integers of k(p) 12.3. euclid's algorithm 12.4. application of euclid's algorithm to the fundamental theorem 12.5. historical remarks on euclid's algorithm and the fundamental theorem 12.6. properties of the gaussian integers 12.7. primes in k(i) 12.8. the fundamental theorem of arithmetic in k(i) 12.9. the integers of k(p) xiii. some diophantine equations 13.1. fermat's last theorem 13.2. the equation x2+y2=z2 13.3. the equation x4+y4=z4 13.4. the equation x3+y3=z3 13.5. the equation x3+y3=3z3 13.6. the expression of a rational as a sum of rational cubes 13.7. the equation x3+y3+z3=t3 xiv. quadratic fields (1) 14. i. algebraic fields 14.2. algebraic numbers and integers; primitive polynomials 14.3. the general quadratic field k(√m) 14.4. unities and primes 14.5. the unities of k(√2) 14.6. fields in which the fundamental theorem is false 14.7. complex euclidean fields 14.8. real euclidean fields 14.9. real euclidean fields (continued) xv. quadratic fields (2) 15.1. the primes of k(i) 15.2. fermat's theorem in k(i) 15.3. the primes of k(p) 15.4. the primes of k(√2) and k(√5) 15.5. lucas's test for the primality of the mersenne number m4n+s 15.6. general remarks on the arithmetic of quadratic fields 15.7. ideals in a quadratic field 15.8. other fields xvi. the arithmetical functions ~(n), ft(n), d(n), a(n), r(n) 16.1. the function ∮(n) 16.2. a further proof of theorem 63 16.3. the m6bius function 16.4. the m6bius inversion formula 16.5. further inversion formulae 16.6. evaluation of ramanujan's sum 16.7. the functions d(n) and ak(n) 16.8. perfect numbers 16.9. the function r(n) 16.10. proof of the formula for r(n) xvii. generating functions of arithmetical functions 17.1 the generation of arithmetical functions by means of dirichlet series 17.2. the zeta function 17.3. the behaviour of ~(s) when s - 1 17.4. multiplication of dirichlet series 17.5. the generating functions of some special arithmetical functions 17.6. the analytical interpretation of the m6bius formula 17.7. the function a(n) 17.8. further examples of generating functions 17.9. the generating function of r(n) 17.10. generating functions of other types xviii. the order of magnitude of arithmetical functions 18.1. the order of d(n) 18.2. the average order of d(n) 18.3. the order of a(n) 18.4. the order of (n) 18.5. the average order of ∮(n) 18.6. the number of squarefree numbers 18.7. the order of r(n) xix. partitions 19.1. the general problem of additive arithmetic 19.2. partitions of numbers 19.3. the generating function of p(n) 19.4. other generating functions 19.5. two theorems of euler 19.6. further algebraical identities 19.7. another formula for f(x) 19.8. a theorem of jacobi 19.9. special cases of jacobi's identity 19.10. applications of theorem 353 19.11. elementary proof of theorem 358 19.12. congruence properties of p(n) 19.13. the rogers-ramanujan identities 19.14. proof of theorems 362 and 363 19.15. ramanujan's continued fraction xx. the representation of a number by two or four squares 20.1. waring's problem: the numbers g(k) and g(k) 20.2. squares 20.3. second proof of theorem 366 20.4. third and fourth proofs of theorem 366 20.5. the four-square theorem 20.6. quaternions 20.7. preliminary theorems about integral quaternions 20.8. the highest common right-hand divisor of two quaternions 20.9. prime quaternions and the proof of theorem 370 20.10. the values of g(2) and g(2) 20.11. lemmas for the third proof of theorem 369 20.12. third proof of theorem 369: the number of representations 20.13. representations by a larger number of squares xxi. representation by cubes and higher powers 21.1. biquadrates 21.2. cubes: the existence of g(3) and g(3) 21.3. a bound for g(3) 21.4. higher powers 21.5. a lower bound for g(k) 21.6. lower bounds for o(k) 21.7. sums affected with signs: the number v(k) 21.8. upper bounds for v(k) 21.9. the problem of prouhet and tarry: the number p(k, j) 21.10. evaluation of p(k, j) for particular k and j 21.11. further problems of diophantine analysis xxii. the series of primes (3) 22.1. the functions tg(x) and ~b(x) 22.2. proof that tg(x) and ~b(x) are of order x 22.3. bertrand's postulate and a 'formula' for primes 22.4. proof of theorems 7 and 9 22.5. two formal transformations 22.6. an important sum 22.7. the ∑p-1 and the product ∏ (1--p-1) 22.8. mertens's theorem 22.9. proof of theorems 323 and 328 22.10. the number of prime factors of n 22.11. the normal order of co(n) and g~(n) 22.12. a note on round numbers 22.13. the normal order of d(n) 22.14. selberg's theorem 22.15. the functions r(x) and v(~) 22.16. completion of the proof of theorems 434, 6 and 8 22.17. proof of theorem 335 22.18. products of k prime factors 22.19. primes in an interval 22.20. a conjecture about the distribution of prime pairs p, p+ 2 xxiii. kronecker's theorem 23.1. kronecker's theorem in one dimension 23.2. proofs of the one-dimensional theorem 23.3. the problem of the reflected ray 23.4. statement of the general theorem 23.5. the two forms of the theorem 23.6. an illustration 23.7. lettenmeyer's proof of the theorem 23.8. estermann's proof of the theorem 23.9. bohr's proof of the theorem 23.10. uniform distribution xxiv. geometry of numbers 24.1. introduction and restatement of the fundamental theorem 24.2. simple applications 24.3. arithmetical proof of theorem 24.4. best possible inequalities 24.5. the best possible inequality for 24.6. the best possible inequality for 24.7. a theorem concerning non-homogeneous forms 24.8. arithmetical proof of theorem 24.9. tchebotaref's theorem 24.10. a converse of minkowski's theorem appendix 1. another formula for pn 2. a generalization of theorem 22 3. unsolved problems concerning primes a list of books index of special symbols and words index of names |
商品评论(0条)