登入選單
返回Google圖書搜尋
Number Theory for Computing
Song Y. Yan
出版Springer Science & Business Media, 2013-03-09
主題Computers / Programming / AlgorithmsComputers / Security / Cryptography & EncryptionComputers / Information TheoryMathematics / Number TheoryComputers / Computer ScienceMathematics / Algebra / GeneralTechnology & Engineering / Electronics / GeneralMathematics / Probability & Statistics / Stochastic ProcessesLanguage Arts & Disciplines / Library & Information Science / GeneralMathematics / Discrete Mathematics
ISBN36620405309783662040539
URLhttp://books.google.com.hk/books?id=X8aqCAAAQBAJ&hl=&source=gbs_api
EBookSAMPLE
註釋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.