| 書目名稱 | Prime Numbers and Computer Methods for Factorization | | 編輯 | Hans Riesel | | 視頻video | http://file.papertrans.cn/756/755252/755252.mp4 | | 叢書名稱 | Progress in Mathematics | | 圖書封面 |  | | 描述 | In this book the author treats four fundamental and apparently simple problems. They are: the number of primes below a given limit, the ap- proximate number of primes, the recognition of prime numbers and the factorization of large numbers. A chapter on the details of the distribution of the primes is included as well as a short description of a recent applica- tion of prime numbers, the so-called RSA public-key cryptosystem. The author is also giving explicit algorithms and computer programs. Whilst not claiming completeness, the author has tried to give all important results known, including the latest discoveries. The use of computers has in this area promoted a development which has enormously enlarged the wealth of results known and that has made many older works and tables obsolete. As is often the case in number theory, the problems posed are easy to understand but the solutions are theoretically advanced. Since this text is aimed at the mathematically inclined layman, as well as at the more advanced student, not all of the proofs of the results given in this book are shown. Bibliographical references in these cases serve those readers who wish to probe deeper. References to | | 出版日期 | Book 19851st edition | | 關(guān)鍵詞 | Approximation; Area; Mathematica; Mersenne number; Mersenne prime; Prime; arithmetic; continued fraction; cr | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4757-1089-2 | | isbn_ebook | 978-1-4757-1089-2Series ISSN 0743-1643 Series E-ISSN 2296-505X | | issn_series | 0743-1643 | | copyright | Birkh?user Boston 1985 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-9 12:41
發(fā)表于 2025-3-21 18:11:52
