--- product_id: 3220206 title: "Concrete Mathematics: A Foundation for Computer Science (2nd Edition)" price: "NT$5114" currency: TWD in_stock: true reviews_count: 10 url: https://www.desertcart.tw/products/3220206-concrete-mathematics-a-foundation-for-computer-science-2nd-edition store_origin: TW region: Taiwan --- # Concrete Mathematics: A Foundation for Computer Science (2nd Edition) **Price:** NT$5114 **Availability:** ✅ In Stock ## Quick Answers - **What is this?** Concrete Mathematics: A Foundation for Computer Science (2nd Edition) - **How much does it cost?** NT$5114 with free shipping - **Is it available?** Yes, in stock and ready to ship - **Where can I buy it?** [www.desertcart.tw](https://www.desertcart.tw/products/3220206-concrete-mathematics-a-foundation-for-computer-science-2nd-edition) ## Best For - Customers looking for quality international products ## Why This Product - Free international shipping included - Worldwide delivery with tracking - 15-day hassle-free returns ## Description Concrete Mathematics: A Foundation for Computer Science (2nd Edition): 8601400000915: Computer Science Books @ desertcart.com Review: Phenomenal introduction to discrete math & asymptotics - This book is classic Knuth: brilliant, comprehensive, inviting, and playful. Highly, highly recommended. This book is ideal for self-study. Material covered includes the basics of discrete math, plus some extras needed for analysis of algorithms. There is an explicit and polemical slant towards a concrete (Knuth calls it 'Eulerian') approach, but this basically just means the emphasis is on explicit calculation and motivating examples, rather than 'elegant' formality and abstraction. In terms of topics, the book starts with a chapter introducing recurrences, then guides the reader through developing familiarity and calculational skill with sums and sigma notation; floors and ceilings; modular arithmetic and a bit of number theory; binomial coefficients and special functions, finally culminating with generating functions, which provide a general framework for solving recurrences encountered in earlier chapters. There are also a couple of chapters on discrete probability and asymptotics, which round out the stated goal of the book: covering preparatory mathematical material needed for the analysis of algorithms in Knuth's Art of Computer Programming. As with TAOCP, the problem sets are as enjoyable and carefully constructed as the exposition, and the solutions are included in the back of the book (about 500 pages of exposition, and about 100 pages of solutions). These problems could easily keep an interested person busy for a lifetime. They are each graded using Knuth's customary scale, and range from the trivially easy to open research problems. Review: Maybe best book of its kind, but no walk in the park. - I love this book. It's extremely dense, which is great for me because I will keep learning from it for months or years to come. If you're relatively new to the subject, like me, a lot of this book won't be easy to comprehend the first time around, however with determination and online resources for help, you can get through it. Even without online resources, if you keep going when you don't understand something, and try to work out the examples on paper, you will get far. After studying this book for a while, go back to the sections that you missed the first time and they should make more sense. Try as many of the exercises as you can, some are very difficult, but others can be accomplished the first time around. This book is not for the faint of heart. If you aren't using it for a class, it will take a lot of dedication to make it through. That said, it's one of the best resources for learning discrete and continuous mathematics that relate to computer science. A great precursor to many of the great algorithm books. ## Technical Specifications | Specification | Value | |---------------|-------| | Best Sellers Rank | #145,383 in Books ( See Top 100 in Books ) #5 in Computer Algorithms #12 in Programming Algorithms #117 in Mathematics (Books) | | Customer Reviews | 4.6 4.6 out of 5 stars (268) | | Dimensions | 9.38 x 7.82 x 1.44 inches | | Edition | 2nd | | ISBN-10 | 0201558025 | | ISBN-13 | 978-0201558029 | | Item Weight | 2.8 pounds | | Language | English | | Print length | 672 pages | | Publication date | February 28, 1994 | | Publisher | Addison-Wesley Professional | ## Images ![Concrete Mathematics: A Foundation for Computer Science (2nd Edition) - Image 1](https://m.media-amazon.com/images/I/91vRF15qLuL.jpg) ## Customer Reviews ### ⭐⭐⭐⭐⭐ Phenomenal introduction to discrete math & asymptotics *by J***. on October 3, 2020* This book is classic Knuth: brilliant, comprehensive, inviting, and playful. Highly, highly recommended. This book is ideal for self-study. Material covered includes the basics of discrete math, plus some extras needed for analysis of algorithms. There is an explicit and polemical slant towards a concrete (Knuth calls it 'Eulerian') approach, but this basically just means the emphasis is on explicit calculation and motivating examples, rather than 'elegant' formality and abstraction. In terms of topics, the book starts with a chapter introducing recurrences, then guides the reader through developing familiarity and calculational skill with sums and sigma notation; floors and ceilings; modular arithmetic and a bit of number theory; binomial coefficients and special functions, finally culminating with generating functions, which provide a general framework for solving recurrences encountered in earlier chapters. There are also a couple of chapters on discrete probability and asymptotics, which round out the stated goal of the book: covering preparatory mathematical material needed for the analysis of algorithms in Knuth's Art of Computer Programming. As with TAOCP, the problem sets are as enjoyable and carefully constructed as the exposition, and the solutions are included in the back of the book (about 500 pages of exposition, and about 100 pages of solutions). These problems could easily keep an interested person busy for a lifetime. They are each graded using Knuth's customary scale, and range from the trivially easy to open research problems. ### ⭐⭐⭐⭐⭐ Maybe best book of its kind, but no walk in the park. *by R***S on January 31, 2016* I love this book. It's extremely dense, which is great for me because I will keep learning from it for months or years to come. If you're relatively new to the subject, like me, a lot of this book won't be easy to comprehend the first time around, however with determination and online resources for help, you can get through it. Even without online resources, if you keep going when you don't understand something, and try to work out the examples on paper, you will get far. After studying this book for a while, go back to the sections that you missed the first time and they should make more sense. Try as many of the exercises as you can, some are very difficult, but others can be accomplished the first time around. This book is not for the faint of heart. If you aren't using it for a class, it will take a lot of dedication to make it through. That said, it's one of the best resources for learning discrete and continuous mathematics that relate to computer science. A great precursor to many of the great algorithm books. ### ⭐⭐⭐⭐⭐ Print version is great. Do NOT buy the kindle version *by E***R on May 23, 2019* There are so many font and ligature issues in the kindle version of this book, it is virtually unuseable. But the print version is great. Other reviewers take issue with the lack of examples for some of the more advanced topics, and one reviewer attributes other's favorable reviews to Knuth "fan-boy-ism". I feel Knuth is (deservedly) a legend because of the topics he chooses and the detail in which he covers them--not because he always has the best way of presenting the information to students. Even though his books include exercises, I don't consider any of Knuth's books to be good textbooks and I am glad I never had to take a course where any of his books were used as the main text. I have been writing scientific applications software for over forty years, and Knuth's books have proven to be extremely valuable reference books for me. Compare the topics covered in Knuth's books to other algorithm books like Sedgwick or Cormen, et al. and you will find lots of useful information that is unique to Knuth. ## Frequently Bought Together - Concrete Mathematics: A Foundation for Computer Science (2nd Edition) - Art of Computer Programming, The, Volumes 1-4B, Boxed Set (Art of Computer Programming, 1-4) - Introduction to Algorithms, fourth edition --- ## Why Shop on Desertcart? - 🛒 **Trusted by 1.3+ Million Shoppers** — Serving international shoppers since 2016 - 🌍 **Shop Globally** — Access 737+ million products across 21 categories - 💰 **No Hidden Fees** — All customs, duties, and taxes included in the price - 🔄 **15-Day Free Returns** — Hassle-free returns (30 days for PRO members) - 🔒 **Secure Payments** — Trusted payment options with buyer protection - ⭐ **TrustPilot Rated 4.5/5** — Based on 8,000+ happy customer reviews **Shop now:** [https://www.desertcart.tw/products/3220206-concrete-mathematics-a-foundation-for-computer-science-2nd-edition](https://www.desertcart.tw/products/3220206-concrete-mathematics-a-foundation-for-computer-science-2nd-edition) --- *Product available on Desertcart Taiwan* *Store origin: TW* *Last updated: 2026-04-22*