Elementary Number Theory In Nine Chapters

by James J. Tattersall

• ISBN13: 9780521850148
• ISBN10: 0521850142
• eBook ISBN(s): 9780511123870
• Edition: 2nd
• Format: Hardcover
• Copyright: 2005-07-11
• Publisher: Cambridge University Press
• More Book Details

Summary

This textbook is intended to serve as a one-semester introductory course in number theory and in this second edition it has been revised throughout and many new exercises have been added. Historical perspective is included and emphasis is given to some of the subject's applied aspects; in particular the field of cryptography is highlighted. At the heart of the book are the major number theoretic accomplishments of Euclid, Fermat, Gauss, Legendre, and Euler, and to fully illustrate the properties of numbers and concepts developed in the text, a wealth of exercises have been included. It is assumed that the reader will have 'pencil in hand' and ready access to a calculator or computer. For students new to number theory, whatever their background, this is a stimulating and entertaining introduction to the subject.

Table of Contents

Preface	ix
1 The intriguing natural numbers
1.1 Polygonal numbers	1	(22)
1.2 Sequences of natural numbers	23	(17)
1.3 The principle of mathematical induction	40	(3)
1.4 Miscellaneous exercises	43	(7)
1.5 Supplementary exercises	50	(5)
2 Divisibility
2.1 The division algorithm	55	(9)
2.2 The greatest common divisor	64	(6)
2.3 The Euclidean algorithm	70	(6)
2.4 Pythagorean triples	76	(5)
2.5 Miscellaneous exercises	81	(3)
2.6 Supplementary exercises	84	(3)
3 Prime numbers
3.1 Euclid on primes	87	(7)
3.2 Number theoretic functions	94	(9)
3.3 Multiplicative functions	103	(5)
3.4 Factoring	108	(4)
3.5 The greatest integer function	112	(3)
3.6 Primes revisited	115	(14)
3.7 Miscellaneous exercises	129	(4)
3.8 Supplementary exercises	133	(3)
4 Perfect and amicable numbers
4.1 Perfect numbers	136	(9)
4.2 Fermat numbers	145	(2)
4.3 Amicable numbers	147	(3)
4.4 Perfect-type numbers	150	(9)
4.5 Supplementary exercises	159	(2)
5 Modular arithmetic
5.1 Congruence	161	(8)
5.2 Divisibility criteria	169	(4)
5.3 Euler's phi-function	173	(8)
5.4 Conditional linear congruences	181	(9)
5.5 Miscellaneous exercises	190	(3)
5.6 Supplementary exercises	193	(3)
6 Congruences of higher degree
6.1 Polynomial congruences	196	(4)
6.2 Quadratic congruences	200	(12)
6.3 Primitive roots	212	(10)
6.4 Miscellaneous exercises	222	(1)
6.5 Supplementary exercises	223	(3)
7 Cryptology
7.1 Monoalphabetic ciphers	226	(9)
7.2 Polyalphabetic ciphers	235	(10)
7.3 Knapsack and block ciphers	245	(5)
7.4 Exponential ciphers	250	(5)
7.5 Supplementary exercises	255	(3)
8 Representations
8.1 Sums of squares	258	(16)
8.2 Pell's equation	274	(6)
8.3 Binary quadratic forms	280	(3)
8.4 Finite continued fractions	283	(8)
8.5 Infinite continued fractions	291	(7)
8.6 ρ-Adic analysis	298	(4)
8.7 Supplementary exercises	302	(2)
9 Partitions
9.1 Generating functions	304	(2)
9.2 Partitions	306	(5)
9.3 Pentagonal Number Theorem	311	(13)
9.4 Supplementary exercises	324	(2)
Tables
T.1 List of symbols used	326	(3)
T.2 Primes less than 10 000	329	(4)
T.3 The values of τ(n), σ(n), φ(n), μ(n), ω(n), and Ω(n) for natural numbers less than or equal to 100	333	(3)
Answers to selected exercises	336	(75)
Bibliography
Mathematics (general)	411	(1)
History (general)	412	(1)
Chapter references	413	(8)
Index	421