1001 Problems In Classical Number Theory

In the spirit of The Book of the One Thousand and One Nights, the authors offer 1001 problems in number theory in a way that entices the reader to immediately attack the next problem. Whether a novice or an experienced mathematician, anyone fascinated by numbers will find a great variety of problems--some simple, others more complex--that will provide them with a wonderful mathematical experience.

Second edition sold 2241 copies in N.A. and 1600 ROW. New edition contains 50 percent new material.

"Natural numbers are the oldest human invention. This book describes their nature, laws, history and current status. It has seven chapters. The first five chapters contain not only the basics of elementary number theory for the convenience of teaching and continuity of reading, but also many latest research results. The first time in history, the traditional name of the Chinese Remainder Theorem is replaced with the Qin Jiushao Theorem in the book to give him a full credit for his establishment of this famous theorem in number theory. Chapter 6 is about the fascinating congruence modulo an integer power, and Chapter 7 introduces a new problem extracted by the author from the classical problems of number theory, which is out of the combination of additive number theory and multiplicative number theory. One feature of the book is the supplementary material after each section, there by broadening the reader's knowledge and imagination. These contents either discuss the rudiments of some aspects or introduce new problems or conjectures and their extensions, such as perfect number problem, Egyptian fraction problem, Goldbach's conjecture, the twin prime conjecture, the 3x + 1 problem, Hilbert Waring problem, Euler's conjecture, Fermat's Last Theorem, Laudau's problem and etc. This book is written for anyone who loves natural numbers, and it can also be read by mathematics majors, graduate students, and researchers. The book contains many illustrations and tables. Readers can appreciate the author's sensitivity of history, broad range of knowledge, and elegant writing style, while benefiting from the classical works and great achievements of masters in number theory"--

[Hilbert's] style has not the terseness of many of our modem authors in mathematics, which is based on the assumption that printer's labor and paper are costly but the reader's effort and time are not. H. Weyl [143] The purpose of this book is to describe the classical problems in additive number theory and to introduce the circle method and the sieve method, which are the basic analytical and combinatorial tools used to attack these problems. This book is intended for students who want to lel?Ill additive number theory, not for experts who already know it. For this reason, proofs include many "unnecessary" and "obvious" steps; this is by design. The archetypical theorem in additive number theory is due to Lagrange: Every nonnegative integer is the sum of four squares. In general, the set A of nonnegative integers is called an additive basis of order h if every nonnegative integer can be written as the sum of h not necessarily distinct elements of A. Lagrange 's theorem is the statement that the squares are a basis of order four. The set A is called a basis offinite order if A is a basis of order h for some positive integer h. Additive number theory is in large part the study of bases of finite order. The classical bases are the squares, cubes, and higher powers; the polygonal numbers; and the prime numbers. The classical questions associated with these bases are Waring's problem and the Goldbach conjecture.

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.