A Course In Algebraic Number Theory

A description of 148 algorithms fundamental to number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods, including a detailed description of the number field sieve algorithm. The whole is rounded off with a description of available computer packages and some useful tables, backed by numerous exercises. Written by an authority in the field, and one with great practical and teaching experience, this is certain to become the standard and indispensable reference on the subject.

This text for a graduate-level course covers the general theory of factorization of ideals in Dedekind domains as well as the number field case. It illustrates the use of Kummer's theorem, proofs of the Dirichlet unit theorem, and Minkowski bounds on element and ideal norms. 2003 edition.

Ideal either for classroom use or as exercises for mathematically minded individuals, this text introduces elementary valuation theory, extension of valuations, local and ordinary arithmetic fields, and global, quadratic, and cyclotomic fields.

Broad graduate-level account of Algebraic Number Theory, first published in 2001, including exercises, by a world-renowned author.

The problems are systematically arranged to reveal the evolution of concepts and ideas of the subject Includes various levels of problems - some are easy and straightforward, while others are more challenging All problems are elegantly solved

This monograph makes available, in English, the elementary parts of classical algebraic number theory. This second edition follows closely the plan and style of the first edition. The principal changes are the correction of misprints, the expansion or simplification of some arguments, and the omission of the final chapter on units in order to make way for the introduction of some two hundred problems.

Bringing the material up to date to reflect modern applications, this second edition has been completely rewritten and reorganized to incorporate a new style, methodology, and presentation. It offers a more complete and involved treatment of Galois theory, a more comprehensive section on Pollard's cubic factoring algorithm, and more detailed explanations of proofs to provide a sound understanding of challenging material. This edition also studies binary quadratic forms and compares the ideal and form class groups. The text includes convenient cross-referencing, a comprehensive index, and numerous exercises and applications.

Now in paperback, this classic book is addresssed to all lovers of number theory. On the one hand, it gives a comprehensive introduction to constructive algebraic number theory, and is therefore especially suited as a textbook for a course on that subject. On the other hand many parts go beyond an introduction an make the user familliar with recent research in the field. For experimental number theoreticians new methods are developed and new results are obtained which are of great importance for them. Both computer scientists interested in higher arithmetic and those teaching algebraic number theory will find the book of value.