The higher arithmetic : an introduction to the theory of numbers

Title:

Personal Author:

Davenport, H.

Publication Information:

Cambridge, UK : Cambridge University Press, 2008

Physical Description:

ix, 239 p. : ill. ; 23 cm.

ISBN:

9780521722360

Subject Term:

Number theory

Added Author:

Davenport, James Harold, 1953-

Available:*

Library	Item Barcode	Call Number	Material Type	Item Category 1	Status
Searching... PSZ JB	30000010201716	QA241 D3 2008	Open Access Book	Book	Searching... Unknown

The theory of numbers is generally considered to be the 'purest' branch of pure mathematics and demands exactness of thought and exposition from its devotees. It is also one of the most highly active and engaging areas of mathematics. Now into its eighth edition The Higher Arithmetic introduces the concepts and theorems of number theory in a way that does not require the reader to have an in-depth knowledge of the theory of numbers but also touches upon matters of deep mathematical significance. Since earlier editions, additional material written by J. H. Davenport has been added, on topics such as Wiles' proof of Fermat's Last Theorem, computers and number theory, and primality testing. Written to be accessible to the general reader, with only high school mathematics as prerequisite, this classic book is also ideal for undergraduate courses on number theory, and covers all the necessary material clearly and succinctly.

Author Notes

H. Davenport, M.A., SC.D., F.R.S., late Rouse Ball Professor of Mathematics in the University of Cambridge and Fellow of Trinity College

Introduction	p. viii
I Factorization and the Primes	p. 1
1 The laws of arithmetic	p. 1
2 Proof by induction	p. 6
3 Prime numbers	p. 8
4 The fundamental theorem of arithmetic	p. 9
5 Consequences of the fundamental theorem	p. 12
6 Euclid's algorithm	p. 16
7 Another proof of the fundamental theorem	p. 18
8 A property of the H.C.F	p. 19
9 Factorizing a number	p. 22
10 The series of primes	p. 25
II Congruences	p. 31
1 The congruence notation	p. 31
2 Linear congruences	p. 33
3 Fermat's theorem	p. 35
4 Euler's function [phi] (m)	p. 37
5 Wilson's theorem	p. 40
6 Algebraic congruences	p. 41
7 Congruences to a prime modulus	p. 42
8 Congruences in several unknowns	p. 45
9 Congruences covering all numbers	p. 46
III Quadratic Residues	p. 49
1 Primitive roots	p. 49
2 Indices	p. 53
3 Quadratic residues	p. 55
4 Gauss's lemma	p. 58
5 The law of reciprocity	p. 59
6 The distribution of the quadratic residues	p. 63
IV Continued Fractions	p. 68
1 Introduction	p. 68
2 The general continued fraction	p. 70
3 Euler's rule	p. 72
4 The convergents to a continued fraction	p. 74
5 The equation ax - by = 1	p. 77
6 Infinite continued fractions	p. 78
7 Diophantine approximation	p. 82
8 Quadratic irrationals	p. 83
9 Purely periodic continued fractions	p. 86
10 Lagrange's theorem	p. 92
11 Pell's equation	p. 94
12 A geometrical interpretation of continued fractions	p. 99
V Sums of Squares	p. 103
1 Numbers representable by two squares	p. 103
2 Primes of the form 4k + 1	p. 104
3 Constructions for x and y	p. 108
4 Representation by four squares	p. 111
5 Representation by three squares	p. 114
VI Quadratic Forms	p. 116
1 Introduction	p. 116
2 Equivalent forms	p. 117
3 The discriminant	p. 120
4 The representation of a number by a form	p. 122
5 Three examples	p. 124
6 The reduction of positive definite forms	p. 126
7 The reduced forms	p. 128
8 The number of representations	p. 131
9 The class-number	p. 133
VII Some Diphantine Equations	p. 137
1 Introduction	p. 137
2 The equation x[superscript 2] + y[superscript 2] = z[superscript 2]	p. 138
3 The equation ax[superscript 2] + by[superscript 2] = z[superscript 2]	p. 140
4 Elliptic equations and curves	p. 145
5 Elliptic equations modulo primes	p. 151
6 Fermat's Last Theorem	p. 154
7 The equation x[superscript 3] + y[superscript 3] = z[superscript 3] + w[superscript 3]	p. 157
8 Further developments	p. 159
VIII Computers and Number Theory	p. 165
1 Introduction	p. 165
2 Testing for primality	p. 168
3 'Random' number generators	p. 173
4 Pollard's factoring methods	p. 179
5 Factoring and primality via elliptic curves	p. 185
6 Factoring large numbers	p. 188
7 The Diffie-Hellman cryptographic method	p. 194
8 The RSA cryptographic method	p. 199
9 Primality testing revisited	p. 200
Exercises	p. 209
Hints	p. 222
Answers	p. 225
Bibliography	p. 235
Index	p. 237

Available:*

On Order

Summary

Summary

Author Notes

Table of Contents