Concrete Mathematics: A Foundation for Computer Science"This book introduces the mathematics that supports advanced computer programming and the analysis of algorithms. The primary aim of its well-known authors is to provide a solid and relevant base of mathematical skills - the skills needed to solve complex problems, to evaluate horrendous sums, and to discover subtle patterns in data. It is an indispensable text and reference not only for computer scientists - the authors themselves rely heavily on it! - but for serious users of mathematics in virtually every discipline."--from Amazon.com. |
Other editions - View all
Common terms and phrases
a₁ algorithm answer approximation asymptotic b₁ Bernoulli numbers binomial coefficients binomial theorem calculate Chapter closed form compute constant converges convolution defined denominator derivation distribution dominoes equation Euler's summation formula evaluate example exercise factor Fibonacci numbers Find a closed finite fraction function gives H₁ harmonic numbers hence hypergeometric hypergeometric series identity induction infinite sum Leonhard Euler look mathematics mean and variance multiple Newton series nonnegative integer notation p₁ parameters Pascal's triangle permutation polynomial positive integer power series prime probability probability generating function probability space problem proof prove random variable rational real numbers recurrence replace S₁ sequence solution solve Stern-Brocot Stern-Brocot tree Stirling's approximation Table theorem there's upper index zero Σ Σ