Elementary Number Theory
Springer Science & Business Media, Jul 31, 1998 - Mathematics - 301 pages
Our intention in writing this book is to give an elementary introduction to number theory which does not demand a great deal of mathematical back ground or maturity from the reader, and which can be read and understood with no extra assistance. Our first three chapters are based almost entirely on A-level mathematics, while the next five require little else beyond some el ementary group theory. It is only in the last three chapters, where we treat more advanced topics, including recent developments, that we require greater mathematical background; here we use some basic ideas which students would expect to meet in the first year or so of a typical undergraduate course in math ematics. Throughout the book, we have attempted to explain our arguments as fully and as clearly as possible, with plenty of worked examples and with outline solutions for all the exercises. There are several good reasons for choosing number theory as a subject. It has a long and interesting history, ranging from the earliest recorded times to the present day (see Chapter 11, for instance, on Fermat's Last Theorem), and its problems have attracted many of the greatest mathematicians; consequently the study of number theory is an excellent introduction to the development and achievements of mathematics (and, indeed, some of its failures). In particular, the explicit nature of many of its problems, concerning basic properties of inte gers, makes number theory a particularly suitable subject in which to present modern mathematics in elementary terms.
What people are saying - Write a review
absolutely convergent algebraic apply arithmetic functions calculate Carmichael number Chapter Chinese Remainder Theorem complex numbers composite compute converges absolutely Corollary 5.7 cyclic group deduce define denote Dirichlet series distinct primes divisible equation equivalent Euclid's algorithm Euler's Example Exercise exponent factors Fermat numbers Fermat primes finite follows Gaussian integers gcd(a gives greatest common divisor hence identity implies induction infinitely many primes instance irreducible least Lemma linear congruence mathematics Mersenne Mersenne primes method Minkowski's Theorem mod 9 mod p2 moduli mutually coprime non-zero number system number theory odd prime pair perfect square prime numbers prime q prime-power factorisation primitive root mod proof of Theorem prove Pythagorean triple quadratic residue rational numbers result satisfying set of residues Similarly simultaneous congruences single congruence class solve square roots square-free subgroup Theorem 4.3 unique unit mod vol(X
All Book Search results »
A First Course in Logic: An Introduction to Model Theory, Proof ..., Issue 9
No preview available - 2004