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.

News about this title: — Author Marty Weissman has been awarded a Guggenheim Fellowship for 2020. (Learn more here.) — Selected as a 2018 CHOICE Outstanding Academic Title — 2018 PROSE Awards Honorable Mention An Illustrated Theory of Numbers gives a comprehensive introduction to number theory, with complete proofs, worked examples, and exercises. Its exposition reflects the most recent scholarship in mathematics and its history. Almost 500 sharp illustrations accompany elegant proofs, from prime decomposition through quadratic reciprocity. Geometric and dynamical arguments provide new insights, and allow for a rigorous approach with less algebraic manipulation. The final chapters contain an extended treatment of binary quadratic forms, using Conway's topograph to solve quadratic Diophantine equations (e.g., Pell's equation) and to study reduction and the finiteness of class numbers. Data visualizations introduce the reader to open questions and cutting-edge results in analytic number theory such as the Riemann hypothesis, boundedness of prime gaps, and the class number 1 problem. Accompanying each chapter, historical notes curate primary sources and secondary scholarship to trace the development of number theory within and outside the Western tradition. Requiring only high school algebra and geometry, this text is recommended for a first course in elementary number theory. It is also suitable for mathematicians seeking a fresh perspective on an ancient subject.

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

Analytic number theory is a branch of number theory which uses methods from mathematical analysis in order to solve difficult problems about integers. Analytic number theory can be split into two major areas: multiplicative number theory and additive number theory. Bernhard Riemann made some very important contributions to the field of analytic number theory; among others, he investigated the Riemann zeta function, and he established its importance for understanding the distribution of prime numbers. A typical problem of analytic number theory is the enumeration of number-theoretic objects like primes, solutions of Diophantine equations, etc. Algebraic number theory on the other hand studies the arithmetic of algebraic number fields, i.e., the ring of integers of arbitrary number fields. It embraces, among others, the study of the ideals and of the group of units in the ring of integers and the extent to which unique factorization holds. The purpose and scope of this ''Special Issue" were to collect new results in algebraic number theory and analytic number theory (namely in the areas of ramification theory in algebraic number fields, class field theory, arithmetic functions, L-functions, modular forms and elliptic curves) and in some similar research areas (namely associative algebras, logical algebras, elementary number theory, combinatorics, difference equations, group rings and algebraic hyper-structures).

This book contains 22 lectures presented at the final conference of the Ger man research program (Schwerpunktprogramm) Algorithmic Number The ory and Algebra 1991-1997, sponsored by the Deutsche Forschungsgemein schaft. The purpose of this research program and of the meeting was to bring together developers of computer algebra software and researchers using com putational methods to gain insight into experimental problems and theoret ical questions in algebra and number theory. The book gives an overview on algorithmic methods and on results ob tained during this period. This includes survey articles on the main research projects within the program: • algorithmic number theory emphasizing class field theory, constructive Galois theory, computational aspects of modular forms and of Drinfeld modules • computational algebraic geometry including real quantifier elimination and real algebraic geometry, and invariant theory of finite groups • computational aspects of presentations and representations of groups, especially finite groups of Lie type and their Heeke algebras, and of the isomorphism problem in group theory. Some of the articles illustrate the current state of computer algebra sys tems and program packages developed with support by the research pro gram, such as KANT and LiDIA for algebraic number theory, SINGULAR, RED LOG and INVAR for commutative algebra and invariant theory respec tively, and GAP, SYSYPHOS and CHEVIE for group theory and representation theory.