Uncle Petros is a family joke. An ageing recluse, he lives alone in a suburb of Athens, playing chess and tending to his garden. If you didn't know better, you'd surely think he was one of life's failures. But his young nephew suspects otherwise. For Uncle Petros, he discovers, was once a celebrated mathematician, brilliant and foolhardy enough to stake everything on solving a problem that had defied all attempts at proof for nearly three centuries - Goldbach's Conjecture. His quest brings him into contact with some of the century's greatest mathematicians, including the Indian prodigy Ramanujan and the young Alan Turing. But his struggle is lonely and single-minded, and by the end it has apparently destroyed his life. Until that is a final encounter with his nephew opens up to Petros, once more, the deep mysterious beauty of mathematics. Uncle Petros and Goldbach's Conjecture is an inspiring novel of intellectual adventure, proud genius, the exhilaration of pure mathematics - and the rivalry and antagonism which torment those who pursue impossible goals.

This book provides a detailed description of a most important unsolved mathematical problem ? the Goldbach conjecture. Raised in 1742 in a letter from Goldbach to Euler, this conjecture attracted the attention of many mathematical geniuses. Several great achievements were made, but only until the 1920's. The book gives an exposition of these results and their impact on mathematics, particularly, number theory. It also presents (partly or wholly) selections from important literature, so that readers can get a full picture of the conjecture.

Important results surrounding the proof of Goldbach's ternary conjecture are presented in this book. Beginning with an historical perspective along with an overview of essential lemmas and theorems, this monograph moves on to a detailed proof of Vinogradov's theorem. The principles of the Hardy-Littlewood circle method are outlined and applied to Goldbach's ternary conjecture. New results due to H. Maier and the author on Vinogradov's theorem are proved under the assumption of the Riemann hypothesis. The final chapter discusses an approach to Goldbach's conjecture through theorems by L. G. Schnirelmann. This book concludes with an Appendix featuring a sketch of H. Helfgott's proof of Goldbach's ternary conjecture. The Appendix also presents some biographical remarks of mathematicians whose research has played a seminal role on the Goldbach ternary problem. The author's step-by-step approach makes this book accessible to those that have mastered classical number theory and fundamental notions of mathematical analysis. This book will be particularly useful to graduate students and mathematicians in analytic number theory, approximation theory as well as to researchers working on Goldbach's problem.

The investigation of three problems, perfect numbers, periodic decimals, and Pythagorean numbers, has given rise to much of elementary number theory. In this book, Daniel Shanks, past editor of Mathematics of Computation, shows how each result leads to further results and conjectures. The outcome is a most exciting and unusual treatment. This edition contains a new chapter presenting research done between 1962 and 1978, emphasizing results that were achieved with the help of computers.

A deep understanding of prime numbers is one of the great challenges in mathematics. In this new edition, fundamental theorems, challenging open problems, and the most recent computational records are presented in a language without secrets. The impressive wealth of material and references will make this book a favorite companion and a source of inspiration to all readers. Paulo Ribenboim is Professor Emeritus at Queen's University in Canada, Fellow of the Royal Society of Canada, and recipient of the George Pólya Award of the Mathematical Association of America. He is the author of 13 books and more than 150 research articles. From the reviews of the First Edition: Number Theory and mathematics as a whole will benefit from having such an accessible book exposing advanced material. There is no question that this book will succeed in exciting many new people to the beauty and fascination of prime numbers, and will probably bring more young people to research in these areas. (Andrew Granville, Zentralblatt)

In 2013, a little known mathematician in his late 50s stunned the mathematical community with a breakthrough on an age-old problem about prime numbers. Since then, there has been further dramatic progress on the problem, thanks to the efforts of a large-scale online collaborative effort of a type that would have been unthinkable in mathematics a couple of decades ago, and the insight and creativity of a young mathematician at the start of his career. Prime numbers have intrigued, inspired and infuriated mathematicians for millennia. Every school student studies prime numbers and can appreciate their beauty, and yet mathematicians' difficulty with answering some seemingly simple questions about them reveals the depth and subtlety of prime numbers. Vicky Neale charts the recent progress towards proving the famous Twin Primes Conjecture, and the very different ways in which the breakthroughs have been made: a solo mathematician working in isolation and obscurity, and a large collaboration that is more public than any previous collaborative effort in mathematics and that reveals much about how mathematicians go about their work. Interleaved with this story are highlights from a significantly older tale, going back two thousand years and more, of mathematicians' efforts to comprehend the beauty and unlock the mysteries of the prime numbers.

"This book is the first volume of a two-volume textbook for undergraduates and is indeed the crystallization of a course offered by the author at the California Institute of Technology to undergraduates without any previous knowledge of number theory. For this reason, the book starts with the most elementary properties of the natural integers. Nevertheless, the text succeeds in presenting an enormous amount of material in little more than 300 pages."-—MATHEMATICAL REVIEWS