哈代数论(英文版·第6版)

商家名称	信用等级	购买信息	订购本书
		哈代数论(英文版·第6版)
		哈代数论(英文版·第6版)

基本信息·出版社：人民邮电出版社
·页码：621 页
·出版日期：2009年11月
·ISBN：7115214271/9787115214270
·条形码：9787115214270
·版本：第1版
·装帧：平装
·开本：32
·正文语种：英语
·丛书名：图灵原版数字·统计学系列
·外文书名：An introduction to the theory of numbers

内容简介 《哈代数论(英文版·第6版)》是数论领域的一部传世名著，成书于作者在牛津大学、剑桥大学等学校授课的讲义。书中从各个不同角度对数论进行了阐述，内容包括素数、无理数、同余、费马定理、连分数、不定式、二次域、算术函数、分化等。新版修订了每章末的注解，简要介绍了数论最新的发展；增加了一章讲述椭圆曲线，这是数论中最重要的突破之一。还列出进一步阅读的文献。
《哈代数论(英文版·第6版)》适合数学专业本科生、研究生和教师用作教材或参考书，也适合对数论感兴趣的专业人士阅读参考。
作者简介 G.H.Hardy（1877-1947），20世纪上半叶享有世界声誉的数学大师，是英国数学界和英国分析学派的领袖，对数论和分析学的发展有巨大的贡献和重大的影响，除了自己的研究工作之外，他还培养和指导了众多数学大家，包括印度数学奇才拉马努金和我国数学家华罗庚。
E.M.Wright (1906-2005)，英国著名数学家，毕业于牛津大学，是G．H．Hardy的学生。生前担任英国名校阿伯丁大学校长多年。爱丁堡皇家学会会士、伦敦数学会会士。曾任Journal of Graph Theory和Zentralbtatt fur Mathematik的名誉主编。
媒体推荐 “这本引人入胜的书对这一学科进行了生动、详尽的叙述，而且没有用到太多高深的理论。”
　　——Mathematical Gazette（数学公报）
“……一本非常重要的著作……它一定能继续保持长久、旺盛的生命力……”
　　——Mathematical Reviews（数学评论）
编辑推荐 《哈代数论(英文版·第6版)》是数论领域的一部传世名著，也是现代数学大师哈代的代表作之一书中从多个角度对数论进行了阐述、内容涉及素数、无理数、同余、费马定理、连分数、不定方程、二次域、算术函数、分划等，体现了哈代一贯的写作风格，深入浅出，娓娓道来。
新版与时俱进，修订了每章末的注解，简要介绍了数论最新的发展，增加了一章讲述椭圆曲线、这是数论中最重要的突破之一：还列出进一步阅读的文献。
《哈代数论(英文版·第6版)》自出版以来一直备受学界推崇，被许多知名大学指定为教材或参考书.如牛津大学、麻省理工学院、斯坦福大学、加州大学伯克利分校等，具有深远的影响。
目录
Ⅰ. THE SERIES OF PRIMES (1)
1.1. Divisibility of integers
1.2. Prime numbers
1.3. Statement of the fundamental 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

Ⅱ. 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 results on formulae for primes
2.8. Unsolved problems concerning primes
2.9. Moduli of integers
2.10. Proof of the fundamental theorem or arithmetic
2.11. Another proof of the fundamental theorem

Ⅲ. 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
3.4. Second proof of the theorems
3.5. The integral lattice
3.6. Some simple peoperties of the fundamental lattice
3.7. Third proof of Theorems 28 and
3.8. The Farev dissection of the continuum
3.9. A theorem of Minkowski
3.10 Proof of Minkowski's theorem
3.11. Developments of Theorem

Ⅳ. 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-
4.5. A historical digression 3o
4.6. Geometrical proof of the irrationality of √
4.7. Some more irrational numbers
Ⅴ. CONGRUENCES AND RESIDUES
5.1. Highest common divisor and least common multiple
5.2. Congruences and classes of residues
5.3. Elementary orooerties of congruences
5.4. Linear congruences
5.5. Euler's function φ(m)
5.6. Aoolications of Theorems 59 and 61 to trigonometrical sums
5.7. A general principle
5.8. Construction of the regular polygon of 17 sides

Ⅵ. FFRMAT's THEOREM AND ITS CONSEOUENCES
6.1. Fermat's theorem
6.2. Some properties of binomial coefficients
6.3. A second proof of Theorem
6.4. Proof of Theorem
6.5. Quadratic residues
6.6. Soecial cases of Theorem 79: Wilson's theorem
6.7. Elementary properties of quadratic residues and non-residues
6.8. The order of a (mod m) IslS
6.9. The converse of Fermat's theorem
6.10. Divisibility of 2P-1 _ 1 by p
6.11. Gauss's lemma and the quadratic character of
6.12. The law of reciprocity
6.13. Proof of the law of reciprocity
6.14. Tests for orimalitv
6.15. Factors of Mersenne numbers; a theorem of Euler

Ⅶ. 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 c~nm'uences to a orime 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 von Staudt
7.10. Proof of von Staudt's theorem

Ⅷ. CONGRUENCES TO COMPOSITE MODULI
8.1. Linear congruences
8.2. Congruences of higher degree
8.3. Congruences to a orime-oower modulus
8.4. Examoles
8.5. Bauer's identical congruence
8.6. Bauer's congruence: the case p=
8.7. A theorem of Leudesdorf
8.8. Further consequences of Bauer's theorem
8.9. The residues of 2P-1 and (p - 1)! to modulus p

Ⅸ. 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 numbers 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

Ⅹ. CONTINUED FRACTIONS
10.1. Finite continued fractions
10.2. Convements 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 simplecontinued 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 infinitecontinued fraction
10.10. A lemma
10.11. Equivalent numbers
10.12. Periodic continued fractions
10.13. Some soecial Quadratic surds
10.14. The series of Fibonacci and Lucas
10.15. Approximation by convergents

Ⅺ. APPROXIMATION OF IRRATIONALS BY RATIONALS
11.1. Statement of the oroblem
11.2. Generalities concerning the problem
11.3. An argument of Dirichlet
11.4. Orders of aporoximation
11.5. Aloohrnie nncl 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 π

Ⅻ. THE FUNDAMENIAL THEOREM OF ARITHMETIC INk(1), k(i), AND k(O)
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. Aoolication of Euclid's algorithm to the fundamental theorem in k(1)
12.5. Historical remarks on Euclid's algorithm and the fundamental theorem
12.6. Prooerties of the Gaussian integers
12.7. Primes in k(i)
12.8. The fundnmental theorem of arithmetic in k(i)
12.9. The integers of k(p)

ⅩⅢ. SOME DIOPHANTINE EQUATIONS
13.1. Fermat's last theorem
13.2. The eauation xz 4- vz = zz
13.3. The equation x4 -t- y4 = z
13.4. The equation x3 + y3 = z
13.5. The equation x3 +y3 =3z
13.6. The exoression of a rational as a sum of rational cubes
13.7. The equation x3 +y3 +z3 =t

ⅩⅣ. OUADRATIC FIELDS (1)
14.1. Algebraic fields
14.2. Algebraic numbers and integers: orimitive polynomials
14.3. The general quadratic field k(√m)
14.4. Unities and orimes
14.5. The unities of k(√2)
14.6. Fields in which the fundamental theorem is false
14.7. Comnlex Euclidean fields
14.8. Real Euclidean fields
14.9. Real Euclidean fields (continued)

ⅩⅤ. OUADRATIC FIELDS (2)
15.1. The orimes 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+
15.6. General remarks on the arithmetic of quadratic fields
15.7. Ideals in a quadratic field
15.8. Other fields

ⅩⅥ. THE ARITHMETICAL FUNCTIONS Ф(n),μ(n), d(n), σ(n), r(n)
16.1. The function Ф(n)
16.2. A further proof of Theorem
16.3. The Mrbius function
16.4. The Mrbius inversion formula
16.5. Further inversion formulae
16.6. Evaluation of Ramanuian's sum
16.7. The functions d(n) and crk (n)
16.8. Perfect numbers
16.9. The function r(n)
16.10. Proof of the formula for r(n)

ⅩⅦ. 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→
17.4. Multiplication of Dirichlet series
17.5. The generating functions of some special arithmetical functions 32~
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

ⅩⅧ. 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 σ(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 σ(n)

ⅩⅨ. PARTITIONS
19.1. The general problem of additive arithmetic
19.2. Partitions of numbers
19.3. The generating function ofp(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
19.11. Elementary proof of Theorem
19.12. Congruence properties of p(n)
19.13. The Rogers-Ramanujan identities
19.14. Proof of Theorems 362 and
19.15. Ramanujan's continued fraction

ⅩⅩ. 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
20,4. Third and fourth proofs of Theorem
20.5. The four-square theorem
20.6. Quaternions
20.7. Preliminary theorems about integral quatemions
20.8. The highest common fight-hand divisor of two quatemions
20.9. Prime quatemions and the proof of Theorem
20.10. The values of g(2) and G(2)
20.11. Lemmas for the third proof of Theorem
20.12. Third proof of Theorem 369: the number of representations
20.13. Representations by a larger number of squares

ⅩⅩⅠ. 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 G(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 andj
21.11. Further problems of Diophantine analysis

ⅩⅩⅡ. THE SERIES OF PRIMES(3)
22.1. The functions 0(x) and $(x)
22.2. Proof that 0(x) and ~ (x) are of order x
22.3. Bertrand's postulate and a 'formula' for primes
22.4. Proof of Theorems 7 and
22.5. Two formal transformations
22.6. An important sum
22.7. The sum 12p~ 1 and the product FI (1 - p- 1 )
22.8. Mertens's theorem
22.9. Proof of Theorems 323 and
22.10. The number of prime factors of n
22.11. The normal order of to (n) and f2 (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
22.17. Proof of Theorem
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 +

ⅩⅩⅢ. 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

ⅩⅩⅣ. 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 ξ2 + n
24.6. The best possible inequality for |ξn|
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

ⅩⅩⅤ. ELLIPTIC CURVES
25.1. The congruent number problem
25.2. The addition law on an elliptic curve
25.3. Other equations that define elliptic curves
25.4. Points of finite order
25.5. The group of rational points
25.6. The group of points modulo p.
25.7. Integer points on elliptic curves
25.8. The L-series of an elliptic curve
25.9. Points of finite order and modular curves
25.10. Elliptic curves and Fermat's last theorem

APPENDIX
1. Another formula forpn
2. A generalization of Theorem
3. Unsolved problems concerning primes
A LIST OF BOOKS
INDEX OF SPECIAL SYMBOLS AND WORDS
INDEX OF NAMES
GENERAL INDEX
……
序言 This sixth edition contains a considerable expansion of the end-of-chapternotes. There have been many exciting developments since these were lastrevised, which are now described in the notes. It is hoped that these willprovide an avenue leading the interested reader towards current researchareas. The notes for some chapters were written with the generous help ofother authorities. Professor D. Masser updated the material on Chapters4 and 11, while Professor G.E. Andrews did the same for Chapter 19. Asubstantial amount of new material was added to the notes for Chapter 21by Professor T.D. Wooley, and a similar review of the notes for Chapter 24was undertaken by Professor R. Hans-Gill. We are naturally very gratefulto all of them for their assistance.
In addition, we have added a substantial new chapter, dealing with ellip-tic curves. This subject, which was not mentioned in earlier editions, hascome to be such a central topic in the theory of numbers that it was feltto deserve a full treatment. The material is naturally connected with theoriginal chapter on Dlophantlne Equations.
Finally, we have corrected a significant number of misprints in thefifth edition. A large number of correspondents reported typographical ormathematical errors, and we thank everyone who contributed in this way.
The proposal to produce this new edition originally came from ProfessorsJohn Maitland Wright and John Coates. We are very grateful for theirenthusiastic support.
文摘 插图：

查看更多 下一篇