Number Theory for Computing (Hardcover, 2nd ed. 2002)

There are many surprising connections between the theory of numbers, which is one of the oldest branches of mathematics, and computing and information theory. Number theory has important applications in computer organization and security, coding and cryptography, random number generation, hash functions, and graphics. Conversely, number theorists use computers in factoring large integers, determining primes, testing conjectures, and solving other problems. This book takes the reader from elementary number theory, via algorithmic number theory, to applied number theory in computer science. It introduces basic concepts, results, and methods, and discusses their applications in the design of hardware and software, cryptography, and security. It is aimed at undergraduates in computing and information technology, but will also be valuable to mathematics students interested in applications. In this 2nd edition full proofs of many theorems are added and some corrections are made.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Release date:	April 2002
First published:	2002
Foreword by:	M. E. Hellmann
Authors:	Song Y. Yan
Dimensions:	232 x 155 x 37mm (L x W x T)
Format:	Hardcover
Pages:	435
Edition:	2nd ed. 2002
ISBN-13:	978-3-540-43072-8
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Science & Mathematics > Mathematics > Number theory > General
LSN:	3-540-43072-5
Barcode:	9783540430728

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!