##
**A classical introduction to modern number theory.
2nd ed.**
*(English)*
Zbl 0712.11001

Graduate Texts in Mathematics, 84. New York etc.: Springer-Verlag. xiv, 389 p. DM 98.00 (1990).

This is a somewhat expanded version of the first edition that appeared in 1982 [Springer Graduate texts in mathematics 84, (1982; Zbl 0482.10001). The first edition of 1982 consisted of 18 chapters which have been included in the second edition without alterations. The second edition contains two new chapters, one on the Mordell-Weil theorem for elliptic curves and one on recent developments in arithmetic geometry. The authors wrote the first edition with the purpose to give insight into modern developments in number theory by showing their close relationship with classical, 19th century number theory. The authors wrote the new chapters 19 and 20 in the same spirit. In chapter 19, they give a proof of the Mordell-Weil theorem for elliptic curves over \({\mathbb{Q}}\) without using Kummer theory or algebraic geometry: they first give Cassels’ proof of the weak Mordell-Weil theorem which uses only a weaker version of Dirichlet’s unit theorem for number fields; and then they derive the Mordell-Weil theorem using the standard descent argument which is worked out by elementary arithmetic. Chapter 19 is meant as a preparation for chapter 20, in which the authors give a very interesting overview of the important developments in arithmetic geometry after the appearance of the first edition of their book. Among other things, they discuss the Mordell conjecture proved by Faltings, the Taniyama-Weil conjecture and the result of Frey, Serre and Ribet that this implies Fermat’s last theorem, recent progress on the Birch-Swinnerton-Dyer conjecture by Coates-Wiles, Gross-Zagier, Rubin, and Kolyvagin, and the derivation of Gauss’ class number conjecture from the results of Gross-Zagier. In chapter 20, the authors do not give proofs but they give sufficient background to understand and appreciate the results. Chapter 20 is an excellent introduction for those who want to study the subject more thoroughly.

Reviewer: J.-H.Evertse

### MSC:

11-01 | Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory |

11Axx | Elementary number theory |

11Gxx | Arithmetic algebraic geometry (Diophantine geometry) |

11Nxx | Multiplicative number theory |

11Rxx | Algebraic number theory: global fields |

11Txx | Finite fields and commutative rings (number-theoretic aspects) |

11Dxx | Diophantine equations |

11G05 | Elliptic curves over global fields |

11G40 | \(L\)-functions of varieties over global fields; Birch-Swinnerton-Dyer conjecture |

11D41 | Higher degree equations; Fermat’s equation |

14H52 | Elliptic curves |

### Keywords:

unique factorization; congruence; quadratic reciprocity; quadratic Gauss sums; Jacobi sums; cubic and biquadratic reciprocity; equations over finite fields; zeta functions; quadratic and cyclotomic fields; Stickelberger relation; Eisenstein reciprocity law; Bernoulli numbers; Dirichlet L-functions; Mordell-Weil theorem for elliptic curves; Mordell conjecture; Taniyama-Weil conjecture; Fermat’s last theorem; Birch- Swinnerton-Dyer conjecture; Gauss’ class number conjecture### Citations:

Zbl 0482.10001
PDFBibTeX
XMLCite

\textit{K. Ireland} and \textit{M. Rosen}, A classical introduction to modern number theory. 2nd ed. New York etc.: Springer-Verlag (1990; Zbl 0712.11001)

### Digital Library of Mathematical Functions:

§24.10(iii) Voronoi’s Congruence ‣ §24.10 Arithmetic Properties ‣ Properties ‣ Chapter 24 Bernoulli and Euler Polynomials§24.10(ii) Kummer Congruences ‣ §24.10 Arithmetic Properties ‣ Properties ‣ Chapter 24 Bernoulli and Euler Polynomials

§24.10(i) Von Staudt–Clausen Theorem ‣ §24.10 Arithmetic Properties ‣ Properties ‣ Chapter 24 Bernoulli and Euler Polynomials

§24.17(iii) Number Theory ‣ §24.17 Mathematical Applications ‣ Applications ‣ Chapter 24 Bernoulli and Euler Polynomials

### Online Encyclopedia of Integer Sequences:

Primes p==1 (mod 6) such that 3 and -3 are both cubes (one implies other) modulo p.Primes p of the form m^2 + 27.

a(n) = numerator(((i^n * PolyLog(1 - n, -i) + (-i)^n * PolyLog(1 - n, i))) / (4^n - 2^n)) if n > 0 and a(0) = 1. Here i denotes the imaginary unit.

Primes of the form m^2 + 9*m + 81.