Concrete Mathematics: A Foundation for Computer Science

Front Cover
Addison-Wesley, Jan 1, 1994 - Computers - 657 pages
22 Reviews

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.

Concrete Mathematics is a blending of CONtinuous and disCRETE mathematics. "More concretely," the authors explain, "it is the controlled manipulation of mathematical formulas, using a collection of techniques for solving problems." The subject matter is primarily an expansion of the Mathematical Preliminaries section in Knuth's classic Art of Computer Programming, but the style of presentation is more leisurely, and individual topics are covered more deeply. Several new topics have been added, and the most significant ideas have been traced to their historical roots. The book includes more than 500 exercises, divided into six categories. Complete answers are provided for all exercises, except research problems, making the book particularly valuable for self-study.

Major topics include:

  • Sums
  • Recurrences
  • Integer functions
  • Elementary number theory
  • Binomial coefficients
  • Generating functions
  • Discrete probability
  • Asymptotic methods

This second edition includes important new material about mechanical summation. In response to the widespread use of the first edition as a reference book, the bibliography and index have also been expanded, and additional nontrivial improvements can be found on almost every page. Readers will appreciate the informal style of Concrete Mathematics. Particularly enjoyable are the marginal graffiti contributed by students who have taken courses based on this material. The authors want to convey not only the importance of the techniques presented, but some of the fun in learning and using them.
0201558025B04062001

From inside the book

What people are saying - Write a review

User ratings

5 stars
16
4 stars
4
3 stars
2
2 stars
0
1 star
0

User Review - Flag as inappropriate

I am a total loser in mathematics, and I find this book rather hard, because things that are "Clearly, ..." to the authors are far from that to me. Nevertheless, I'm spending an hour on it every day and it causes me no headache, because it's fun! This is the most entertaining+educating math book I've ever tried to read. 

Review: Concrete Mathematics: A Foundation for Computer Science

User Review  - Siam Ramasamy - Goodreads

Now starting Read full review

Contents

Recurrent Problems
1
Sums
21
Integer Functions
67
Copyright

9 other sections not shown

Common terms and phrases

References to this book

All Book Search results »

About the author (1994)

Donald E. Knuth is known throughout the world for his pioneering work on algorithms and programming techniques, for his invention of the Tex and Metafont systems for computer typesetting, and for his prolific and influential writing. Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes full time to the completion of these fascicles and the seven volumes to which they belong.



Bibliographic information