Seminumerical algorithms 
What people are saying  Write a review
User ratings
5 stars 
 
4 stars 
 
3 stars 
 
2 stars 
 
1 star 

Review: Art of Computer Programming, Volume 2: Seminumerical Algorithms (Art of Computer Programming)
User Review  Eugene Miya  GoodreadsA short story: some years ago, a Silicon Valley institution existed named Computer Literacy Bookshop founded by a couple of friends and run by a 3rd. They sold the shop to a couple of guys who owned ... Read full review
Review: Art of Computer Programming, Volume 2: Seminumerical Algorithms (Art of Computer Programming)
User Review  Arun Rajappa  GoodreadsDifficult, instructive, intelligent, amusing and brainnumbing  all rolledintoone in this classic of CS. Buy it, read a page at a sitting and savor it  this is a book read over 5 years. Read full review
Contents
Chapter 3Random Numbers  1 
CONTENTS  10 
Chapter 4Arithmetic  194 
Copyright  
2 other sections not shown
Common terms and phrases
addition chain applied approximately assume binary bits calculation chisquare test coefficients coeﬂicients Comp consider continued fraction decimal Dedekind sums deﬁned Deﬁnition digits discussed distribution divide division elements equal equidistributed Euclid’s algorithm evaluate example exercise exponent fact ﬁeld ﬁnd ﬁnding ﬁnite ﬁrst ﬁxed ﬂoating point numbers formula function given greatest common divisor hence independent inﬁnite input irreducible lagged Fibonacci Lemma linear congruential sequence Math matrix method middlesquare method modulo multiplication multisets nonnegative nonzero notation number system obtain occurs oodistributed operations output overﬂow period length permutation positive integer possible prime factors primitive polynomial probability problem proof Prove quantity radix radix point random number random sequence real numbers relatively prime representation result satisﬁes Section signiﬁcant solution spectral test step subroutine subtraction Theorem truly random uniform deviates variables vectors zero