This is a book about prime numbers, congruences, secret messages, and elliptic curves that you can read cover to cover. It grew out of undergr- uate courses that the author taught at Harvard, UC San Diego, and the University of Washington. The systematic study of number theory was initiated around 300B. C. when Euclid proved that there are in?nitely many prime numbers, and also cleverly deduced the fundamental theorem of arithmetic, which asserts that every positive integer factors uniquely as a product of primes. Over a thousand years later (around 972A. D. ) Arab mathematicians formulated the congruent number problem that asks for a way to decide whether or not a given positive integer n is the area of a right triangle, all three of whose sides are rational numbers. Then another thousand years later (in 1976), Di?e and Hellman introduced the ?rst ever public-key cryptosystem, which enabled two people to communicate secretely over a public communications channel with no predetermined secret; this invention and the ones that followed it revolutionized the world of digital communication. In the 1980s and 1990s, elliptic curves revolutionized number theory, providing striking new insights into the congruent number problem, primality testing, publ- key cryptography, attacks on public-key systems, and playing a central role in Andrew Wiles’ resolution of Fermat’s Last Theorem.

This two-volume set on Mathematical Principles of the Internet provides a comprehensive overview of the mathematical principles of Internet engineering. The books do not aim to provide all of the mathematical foundations upon which the Internet is based. Instead, they cover a partial panorama and the key principles. Volume 1 explores Internet engineering, while the supporting mathematics is covered in Volume 2. The chapters on mathematics complement those on the engineering episodes, and an effort has been made to make this work succinct, yet self-contained. Elements of information theory, algebraic coding theory, cryptography, Internet traffic, dynamics and control of Internet congestion, and queueing theory are discussed. In addition, stochastic networks, graph-theoretic algorithms, application of game theory to the Internet, Internet economics, data mining and knowledge discovery, and quantum computation, communication, and cryptography are also discussed. In order to study the structure and function of the Internet, only a basic knowledge of number theory, abstract algebra, matrices and determinants, graph theory, geometry, analysis, optimization theory, probability theory, and stochastic processes, is required. These mathematical disciplines are defined and developed in the books to the extent that is needed to develop and justify their application to Internet engineering.

This volume provides accessible and self-contained research problems designed for undergraduate student projects, and simultaneously promotes the development of sustainable undergraduate research programs. The chapters in this work span a variety of topical areas of pure and applied mathematics and mathematics education. Each chapter gives a self-contained introduction on a research topic with an emphasis on the specific tools and knowledge needed to create and maintain fruitful research programs for undergraduates. Some of the topics discussed include:• Disease modeling• Tropical curves and surfaces• Numerical semigroups• Mathematics EducationThis volume will primarily appeal to undergraduate students interested in pursuing research projects and faculty members seeking to mentor them. It may also aid students and faculty participating in independent studies and capstone projects.

Challenge your problem-solving aptitude in number theory with powerful problems that have concrete examples which reflect the potential and impact of theoretical results. Each chapter focuses on a fundamental concept or result, reinforced by each of the subsections, with scores of challenging problems that allow you to comprehend number theory like never before. All students and coaches wishing to excel in math competitions will benefit from this book as will mathematicians and adults who enjoy interesting mathematics.

Who would have thought that listing the positive integers along with their most remarkable properties could end up being such an engaging and stimulating adventure? The author uses this approach to explore elementary and advanced topics in classical number theory. A large variety of numbers are contemplated: Fermat numbers, Mersenne primes, powerful numbers, sublime numbers, Wieferich primes, insolite numbers, Sastry numbers, voracious numbers, to name only a few. The author also presents short proofs of miscellaneous results and constantly challenges the reader with a variety of old and new number theory conjectures. This book becomes a platform for exploring new concepts such as the index of composition and the index of isolation of an integer. In addition, the book displays several tables of particular families of numbers, including the list of all 88 narcissistic numbers and the list of the eight known numbers which are not prime powers but which can be written as the sum of the cubes of their prime factors, and in each case with the algorithm used to create them.

This introductory textbook takes a problem-solving approach to number theory, situating each concept within the framework of an example or a problem for solving. Starting with the essentials, the text covers divisibility, unique factorization, modular arithmetic and the Chinese Remainder Theorem, Diophantine equations, binomial coefficients, Fermat and Mersenne primes and other special numbers, and special sequences. Included are sections on mathematical induction and the pigeonhole principle, as well as a discussion of other number systems. By emphasizing examples and applications the authors motivate and engage readers.