The book provides a self-contained introduction to classical Number Theory. All the proofs of the individual theorems and the solutions of the exercises are being presented step by step. Some historical remarks are also presented. The book will be directed to advanced undergraduate, beginning graduate students as well as to students who prepare for mathematical competitions (ex. Mathematical Olympiads and Putnam Mathematical competition).

This introductory book emphasises algorithms and applications, such as cryptography and error correcting codes.

The book provides a self-contained introduction to classical Number Theory. All the proofs of the individual theorems and the solutions of the exercises are being presented step by step. Some historical remarks are also presented. The book will be directed to advanced undergraduate, beginning graduate students as well as to students who prepare for mathematical competitions (ex. Mathematical Olympiads and Putnam Mathematical competition).

This textbook covers the main topics in number theory as taught in universities throughout the world. Number theory deals mainly with properties of integers and rational numbers; it is not an organized theory in the usual sense but a vast collection of individual topics and results, with some coherent sub-theories and a long list of unsolved problems. This book excludes topics relying heavily on complex analysis and advanced algebraic number theory. The increased use of computers in number theory is reflected in many sections (with much greater emphasis in this edition). Some results of a more advanced nature are also given, including the Gelfond-Schneider theorem, the prime number theorem, and the Mordell-Weil theorem. The latest work on Fermat's last theorem is also briefly discussed. Each chapter ends with a collection of problems; hints or sketch solutions are given at the end of the book, together with various useful tables.

Written by an authority with great practical and teaching experience in the field, this book addresses a number of topics in computational number theory. Chapters one through five form a homogenous subject matter suitable for a six-month or year-long course in computational number theory. The subsequent chapters deal with more miscellaneous subjects.

Challenging, accessible mathematical adventures involving prime numbers, number patterns, irrationals and iterations, calculating prodigies, and more. No special training is needed, just high school mathematics and an inquisitive mind. "A splendidly written, well selected and presented collection. I recommend the book unreservedly to all readers." — Martin Gardner.