| 書目名稱 | Number Theory for Computing | | 編輯 | Song Y. Yan | | 視頻video | http://file.papertrans.cn/669/668880/668880.mp4 | | 概述 | A good introduction to classical and modern number theory and its applications in computer science Self-contained source on number theory for computing professionals Useful for self-study or as class | | 圖書封面 |  | | 描述 | Mathematicians do not study objects, but relations among objectsj they are indifferent to the replacement of objects by others as long as relations do not change. Matter is not important, only form interests them. HENRI POINCARE (1854-1912) Computer scientists working on algorithms for factorization would be well advised to brush up on their number theory. IAN STEWART [219] The theory of numbers, in mathematics, is primarily the theory of the prop- erties of integers (i.e., the whole numbers), particularly the positive integers. For example, Euclid proved 2000 years aga in his Elements that there exist infinitely many prime numbers. The subject has long been considered as the purest branch of mathematics, with very few applications to other areas. How- ever, recent years have seen considerable increase in interest in several central topics of number theory, precisely because of their importance and applica- tions in other areas, particularly in computing and information technology. | | 出版日期 | Textbook 20001st edition | | 關(guān)鍵詞 | Notation; algorithmic number theory; arithmetic functions; computational number theory; cryptography; cry | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-662-04053-9 | | isbn_ebook | 978-3-662-04053-9 | | copyright | Springer-Verlag Berlin Heidelberg 2000 |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-17 04:17
發(fā)表于 2025-3-21 16:39:35
