The Art of Computer Programming: Semi-numerical algorithmsAddison-Wesley Publishing Company, 1968 - Computer algorithms |
Contents
Chapter 3Random Numbers | 1 |
Chapter 4Arithmetic | 161 |
Answers to Exercises | 452 |
Copyright | |
3 other sections not shown
Other editions - View all
Common terms and phrases
addition chain approximately arithmetic assume balanced ternary byte calculation chi-square coefficients consider continued fraction cycles decimal defined definition digits distribution divide division elements equal equation Euclid's algorithm evaluate example exercise exponent factor floating-point numbers Fn(x formula function given greatest common divisor hence Horner's rule input integers Lemma linear congruential sequence log2 matrix middle-square method MIXAL mixed radix modulo multiple multisets nonnegative nonzero normalized notation number system obtained occurs operations overflow period length positive integers possible primitive polynomial probability problem proof prove quantity quotient radix radix point random numbers random sequence real numbers relatively prime representation result satisfy Section spectral test step subroutine subtraction Theorem tion unique factorization domain v₁ variables Xn+1 zero