Book overview
- Sums
- Recurrences
- Integer functions
- Elementary number theory
- Binomial coefficients
- Generating functions
- Discrete probability
- Asymptotic methods
A problem-solving bridge between discrete and continuous mathematics
Faster options are available.
Rates and delivery estimates depend on your destination and item quantity. Estimates are informational only; the final shipping method and rate are selected at checkout.

A problem-solving bridge between discrete and continuous mathematics
Designed around the mathematics used in advanced programming and algorithm analysis, this substantial reference develops techniques for manipulating formulas and extracting patterns from complex calculations. Its coverage moves through sums, recurrences, integer functions, elementary number theory, binomial coefficients, generating functions, discrete probability, and asymptotic methods, with added material on mechanical summation in this second edition. The book expands on the mathematical preliminaries associated with *The Art of Computer Programming*, treating individual subjects in greater depth and tracing major ideas to historical sources. More than 500 exercises, organized into six categories, make practice central; answers are supplied for every exercise except the research problems. An expanded bibliography and index also support its use as a long-term desk reference.
Based on publisher information and book metadata.
In-stock items normally dispatch within 1–2 business days. The ZIP-code estimator on this page is informational only; the final shipping method, price, and availability are confirmed at checkout for your full order.
For the initial delivery estimate we use these transit windows after dispatch: Standard 5–8 business days, Expedited 2–4 business days, and Priority 1–2 business days. Holiday delays are not included.
Eligible items can be returned within 30 days in accordance with our return policy.