This textbook effectively builds a bridge from basic number theory to recent advances in applied number theory. It presents the first unified account of the four major areas of application where number theory plays a fundamental role, namely cryptography, coding theory, quasi-Monte Carlo methods, and pseudorandom number generation, allowing the authors to delineate the manifold links and interrelations between these areas. Number theory, which Carl-Friedrich Gauss famously dubbed the queen of mathematics, has always been considered a very beautiful field of mathematics, producing lovely results and elegant proofs. While only very few real-life applications were known in the past, today number theory can be found in everyday life: in supermarket bar code scanners, in our cars’ GPS systems, in online banking, etc. Starting with a brief introductory course on number theory in Chapter 1, which makes the book more accessible for undergraduates, the authors describe the four main application areas in Chapters 2-5 and offer a glimpse of advanced results that are presented without proofs and require more advanced mathematical skills. In the last chapter they review several further applications of number theory, ranging from check-digit systems to quantum computation and the organization of raster-graphics memory. Upper-level undergraduates, graduates and researchers in the field of number theory will find this book to be a valuable resource.

This text provides a detailed introduction to number theory, demonstrating how other areas of mathematics enter into the study of the properties of natural numbers. It contains problem sets within each section and at the end of each chapter to reinforce essential concepts, and includes up-to-date information on divisibility problems, polynomial congruence, the sums of squares and trigonometric sums.;Five or more copies may be ordered by college or university bookstores at a special price, available on application.

This book provides a good introduction to the classical elementary number theory and the modern algorithmic number theory, and their applications in computing and information technology, including computer systems design, cryptography and network security. In this second edition proofs of many theorems have been provided, further additions and corrections were made.

Number Theory is a newly translated and revised edition of the most popular introductory textbook on the subject in Hungary. The book covers the usual topics of introductory number theory: divisibility, primes, Diophantine equations, arithmetic functions, and so on. It also introduces several more advanced topics including congruences of higher degree, algebraic number theory, combinatorial number theory, primality testing, and cryptography. The development is carefully laid out with ample illustrative examples and a treasure trove of beautiful and challenging problems. The exposition is both clear and precise. The book is suitable for both graduate and undergraduate courses with enough material to fill two or more semesters and could be used as a source for independent study and capstone projects. Freud and Gyarmati are well-known mathematicians and mathematical educators in Hungary, and the Hungarian version of this book is legendary there. The authors' personal pedagogical style as a facet of the rich Hungarian tradition shines clearly through. It will inspire and exhilarate readers.

Exploring one of the most dynamic areas of mathematics, Advanced Number Theory with Applications covers a wide range of algebraic, analytic, combinatorial, cryptographic, and geometric aspects of number theory. Written by a recognized leader in algebra and number theory, the book includes a page reference for every citing in the bibliography and mo

This text provides a detailed introduction to number theory, demonstrating how other areas of mathematics enter into the study of the properties of natural numbers. It contains problem sets within each section and at the end of each chapter to reinforce essential concepts, and includes up-to-date information on divisibility problems, polynomial congruence, the sums of squares and trigonometric sums.;Five or more copies may be ordered by college or university bookstores at a special price, available on application.

Geometry and the theory of numbers are as old as some of the oldest historical records of humanity. Ever since antiquity, mathematicians have discovered many beautiful interactions between the two subjects and recorded them in such classical texts as Euclid's Elements and Diophantus's Arithmetica. Nowadays, the field of mathematics that studies the interactions between number theory and algebraic geometry is known as arithmetic geometry. This book is an introduction to number theory and arithmetic geometry, and the goal of the text is to use geometry as the motivation to prove the main theorems in the book. For example, the fundamental theorem of arithmetic is a consequence of the tools we develop in order to find all the integral points on a line in the plane. Similarly, Gauss's law of quadratic reciprocity and the theory of continued fractions naturally arise when we attempt to determine the integral points on a curve in the plane given by a quadratic polynomial equation. After an introduction to the theory of diophantine equations, the rest of the book is structured in three acts that correspond to the study of the integral and rational solutions of linear, quadratic, and cubic curves, respectively. This book describes many applications including modern applications in cryptography; it also presents some recent results in arithmetic geometry. With many exercises, this book can be used as a text for a first course in number theory or for a subsequent course on arithmetic (or diophantine) geometry at the junior-senior level.

Developed from the author's popular graduate-level course, Computational Number Theory presents a complete treatment of number-theoretic algorithms. Avoiding advanced algebra, this self-contained text is designed for advanced undergraduate and beginning graduate students in engineering. It is also suitable for researchers new to the field and pract

This book is written for the student in mathematics. Its goal is to give a view of the theory of numbers, of the problems with which this theory deals, and of the methods that are used. We have avoided that style which gives a systematic development of the apparatus and have used instead a freer style, in which the problems and the methods of solution are closely interwoven. We start from concrete problems in number theory. General theories arise as tools for solving these problems. As a rule, these theories are developed sufficiently far so that the reader can see for himself their strength and beauty, and so that he learns to apply them. Most of the questions that are examined in this book are connected with the theory of diophantine equations - that is, with the theory of the solutions in integers of equations in several variables. However, we also consider questions of other types; for example, we derive the theorem of Dirichlet on prime numbers in arithmetic progressions and investigate the growth of the number of solutions of congruences.

Algebraic number theory is one of the most refined creations in mathematics. It has been developed by some of the leading mathematicians of this and previous centuries. The primary goal of this book is to present the essential elements of algebraic number theory, including the theory of normal extensions up through a glimpse of class field theory. Following the example set for us by Kronecker, Weber, Hilbert and Artin, algebraic functions are handled here on an equal footing with algebraic numbers. This is done on the one hand to demonstrate the analogy between number fields and function fields, which is especially clear in the case where the ground field is a finite field. On the other hand, in this way one obtains an introduction to the theory of 'higher congruences' as an important element of 'arithmetic geometry'. Early chapters discuss topics in elementary number theory, such as Minkowski's geometry of numbers, public-key cryptography and a short proof of the Prime Number Theorem, following Newman and Zagier. Next, some of the tools of algebraic number theory are introduced, such as ideals, discriminants and valuations. These results are then applied to obtain results about function fields, including a proof of the Riemann-Roch Theorem and, as an application of cyclotomic fields, a proof of the first case of Fermat's Last Theorem. There are a detailed exposition of the theory of Hecke $L$-series, following Tate, and explicit applications to number theory, such as the Generalized Riemann Hypothesis. Chapter 9 brings together the earlier material through the study of quadratic number fields. Finally, Chapter 10 gives an introduction to class field theory. The book attempts as much as possible to give simple proofs. It can be used by a beginner in algebraic number theory who wishes to see some of the true power and depth of the subject. The book is suitable for two one-semester courses, with the first four chapters serving to develop the basic material. Chapters 6 through 9 could be used on their own as a second semester course.