Overview
- 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 text and basic reference
- Only prerequisite is high-school math
- First edition released in 2000
- In the second edition additional proofs of many theorems are provided, corrections and additions were made
- Includes supplementary material: sn.pub/extras
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (3 chapters)
Keywords
About this book
Reviews
From the reviews of the second edition:
"This book gives a profound and detailed insight at an undergraduate level in abstract and computational number theory as well as in applications in computing and cryptography. … The author has done a lot of work in providing a plenty of examples, in adding many historical comments including sketchy biographies … and in presenting the whole topic in a very accessible style. So the book can be recommended warmly for the laymen as well as for the mathematician without experience in applied number theory." (G. Kowol, Monatshefte für Mathematik, Vol. 140 (4), 2003)
Authors and Affiliations
Bibliographic Information
Book Title: Number Theory for Computing
Authors: Song Y. Yan
DOI: https://doi.org/10.1007/978-3-662-04773-6
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2002
Hardcover ISBN: 978-3-540-43072-8Published: 24 April 2002
Softcover ISBN: 978-3-642-07710-4Published: 01 December 2010
eBook ISBN: 978-3-662-04773-6Published: 11 November 2013
Edition Number: 2
Number of Pages: XXII, 435
Topics: Theory of Computation, Algorithm Analysis and Problem Complexity, Cryptology, Coding and Information Theory, Number Theory, Symbolic and Algebraic Manipulation