| 书目名称 | Prime Numbers | | 副标题 | A Computational Pers | | 编辑 | Richard Crandall,Carl Pomerance | | 视频video | | | 概述 | Includes supplementary material: | | 图书封面 |  | | 描述 | In this volume we have endeavored to provide a middle ground-hopefully even a bridge-between "theory" and "experiment" in the matter of prime numbers. Of course, we speak of number theory and computer experiment. There are great books on the abstract properties of prime numbers. Each of us working in the field enjoys his or her favorite classics. But the experimental side is relatively new. Even though it can be forcefully put that computer science is by no means young, as there have arguably been four or five computer "revolutions" by now, it is the case that the theoretical underpinnings of prime numbers go back centuries, even millennia. So, we believe that there is room for treatises based on the celebrated classical ideas, yet authored from a modern computational perspective. Design and scope of this book The book combines the essentially complementary areas of expertise of the two authors. (One author (RC) is more the computationalist, the other (CP) more the theorist. ) The opening chapters are in a theoretical vein, even though some explicit algorithms are laid out therein, while heavier algorithmic concentration is evident as the reader moves well into the book. Whether in | | 出版日期 | Book 20011st edition | | 关键词 | Mersenne prime; Riemann zeta function; Scope; Volume; analytic number theory; arithmetic; bridge; calculus; | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4684-9316-0 | | isbn_ebook | 978-1-4684-9316-0 | | copyright | Springer Science+Business Media New York 2001 |
The information of publication is updating
|
|
发表于 2025-3-21 17:26:16
