Concrete Mathematics: A Foundation for Computer ScienceAddison-Wesley, 1989 - 625 "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. |
Spis treści
Recurrent Problems | 1 |
Sums | 21 |
Integer Functions | 67 |
Prawa autorskie | |
Nie pokazano 9 innych sekcji
Inne wydania - Wyświetl wszystko
Concrete Mathematics: A Foundation for Computer Science Ronald L. Graham,Donald E. Knuth,Oren Patashnik Ograniczony podgląd - 1994 |
Kluczowe wyrazy i wyrażenia
answer appears apply approximation assume asymptotic average binomial coefficients called Chapter closed form coefficients complex compute consider constant corresponds defined definition denominator derivation distribution divide easy equal equation Euler's evaluate exactly example exercise express fact factor Fibonacci final finite follows formula fraction function given gives hence holds hypergeometric identity independent induction infinite it's look mathematics mean method multiple namely negative notation obtain operation pattern polynomial positive integer possible powers prime probability problem proof prove random variable rational recurrence relation replace result rule satisfy sequence side simple solution solve step summation Table tells theorem there's things true turns upper variance write zero