Concrete mathematics : a foundation for computer science / Ronald L. Graham, Donald E. Knuth and Oren Patashnik.
Material type:
TextPublication details: Reading, Massachusetts : Addison-Wesley, ©1994.Edition: 2nd edDescription: xiii, 657 pages : illustrations ; 24 cmISBN: - 0201558025
- 9780201558029
- 510 23 G741
| Item type | Current library | Call number | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|
| Books | ISI Library, Kolkata | 510 G741 (Browse shelf(Opens below)) | Available | C26576 |
Browsing ISI Library, Kolkata shelves Close shelf browser (Hides shelf browser)
| No cover image available | No cover image available | No cover image available | ||||||
| 510 G741 Mathematics of Paul Erdos / | 510 G741 Mathematics of Paul Erdos / | 510 G741 Concrete mathematics : | 510 G741 Concrete mathematics : | 510 G773 Search for mathematical roots, 1870-1940 | 510 G777 Decision mathematics | 510 G779 Hilbert challenge |
Includes bibliographical references and index.
1. Recurrent problems : The Tower of Hanoi ; Lines in the plane ; The Josephus problem --
2. Sums : Notation ; Sums and recurrences ; Manipulation of sums ; General methods ; Finite and infinite calculus ; Infinite sums --
3. Integer functions : Floors and ceilings ; Floor/ceiling applications ; Floor/ceiling recurrences ; 'mod': the binary operation ; Floor/ceiling sums --
4. Number theory : Divisibility ; Primes ; Prime examples ; Factorial factors ; Relative primality ; 'mod': the congruence relation ; Independent residues ; Additional applications ; Phi and mu --
5. Binomial coefficients : Basic identities ; Basic practice ; Tricks of the trade ; Generating functions ; Hypergeometric functions ; Hypergeometric transformations ; Partial hypergeometric sums ; Mechanical summation --
6. Special numbers : Stirling numbers ; Eulerian numbers ; Harmonic numbers ; Harmonic summation ; Bernoulli numbers ; Fibonacci numbers ; Continuants --
7. Generating functions : Domino theory and change ; Basic maneuvers ; Solving recurrence ; Special generating functions ; Convolutions ; Exponential generating functions ; Dirichlet generating functions --
8. Discrete probability : Definitions ; Mean and variance ; Probability generating functions ; Flipping coins ; Hashing --
9. Asymptotics : A hierarchy ; O notation ; O manipulation ; Two asymptotic tricks ; Euler's summation formula ; Final summations.
Introduces the mathematics that supports advanced computer programming and the analysis of algorithms. This book includes more than 500 exercises, divided into six categories. Complete answers are provided for all exercises, except research problems. It is useful for computer scientists and also for users of mathematics in various disciplines.
There are no comments on this title.
