
Concrete Mathematics: Foundation for Computer Science (Hardback)
$64.65  Save $59.27 47% off  RRP $123.92 Free delivery worldwide Available
Dispatched in 2 business days When will my order arrive?  DescriptionThis book introduces the mathematics that supports advanced computer programming and the analysis of algorithms. The primary aim of its wellknown 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 selfstudy. 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
 Publisher: Addison Wesley
 Published: 01 March 1994
 Format: Hardback 672 pages
 See: Full bibliographic data
 Categories: Mathematics  Programming & Scripting Languages: General  Computer Science  Mathematical Theory Of Computation
 ISBN 13: 9780201558029 ISBN 10: 0201558025
 Sales rank: 49,377
Other books
Full bibliographic data for Concrete Mathematics
 Title
 Concrete Mathematics
 Subtitle
 Foundation for Computer Science
 Authors and contributors
 Physical properties
 Format: Hardback
Number of pages: 672
Width: 191 mm
Height: 236 mm
Thickness: 43 mm
Weight: 1,361 g  Language
 English
 ISBN
 ISBN 13: 9780201558029
ISBN 10: 0201558025  Classifications
BIC E4L: COM
B&T Book Type: NF
DC22: 510
LC subject heading:
B&T Merchandise Category: TXT
B&T Modifier: Region of Publication: 01
DC20: 510
BIC subject category V2: PB
Nielsen BookScan Product Class 3: S10.3T
WarengruppenSystematik des deutschen Buchhandels: 16200
B&T Modifier: Academic Level: 02
Abridged Dewey: 510
Ingram Subject Code: MA
B&T Modifier: Text Format: 06
B&T General Subject: 229
B&T Modifier: Text Format: 01
BIC subject category V2: UYA
LC subject heading: , ,
BISAC V2.8: COM014000, COM051010, MAT000000
LC classification: QA39.2.G73, QA39.2 .G733 1994
Thema V1.0: PB, UYA Edition
 2, Revised
 Edition statement
 2nd Revised edition
 Publisher
 Pearson Education (US)
 Imprint name
 Addison Wesley
 Publication date
 01 March 1994
 Publication City/Country
 Boston
 Table of contents
 (Most chapters contain Exercises.) 1. Recurrent Problems. The Tower of Hanoi. Lines in the Plane. The Josephus Problem. Exercises. 2. Sums. Notation. Sums and Recurrences. Manipulation of Sums. Multiple Sums. General Methods. Finite and Infinite Calculus. Infinite Sums. Exercises. 3. Integer Functions. Floors and Ceilings. Floor/Ceiling Applications. Floor/Ceiling Recurrences. 'mod': The Binary Operation. Floor/Ceiling Sums. Exercises. 4. Number Theory. Divisibility. Factorial Factors. Relative Primality. 'mod': The Congruence Relation. Independent Residues. Additional Applications. Phi and Mu. Exercises. 5. Binomial Coefficients. Basic Identities. Basic Practice. Tricks of the Trade. Generating Functions. Hypergeometric Functions. Hypergeometric Transformations. Partial Hypergeometric Sums. Mechanical Summation. Exercises. 6. Special Numbers. Stirling Numbers. Eulerian Numbers. Harmonic Numbers. Harmonic Summation. Bernoulli Numbers. Fibonacci Numbers. Continuants. Exercises. 7. Generating Functions. Domino Theory and Change. Basic Maneuvers. Solving Recurrences. Special Generating Functions. Convolutions. Exponential Generating Functions. Dirichlet Generating Functions. Exercises. 8. Discrete Probability. Definitions. Mean and Variance. Probability Generating Functions. Flipping Coins. Hashing. Exercises. 9. Asymptotics. A Hierarchy. O Notation. O Manipulation. Two Asymptotic Tricks. Euler's Summation Formula. Final Summations. Exercises. A. Answers to Exercises. B. Bibliography. C. Credits for Exercises. Index. List of Tables. 0201558025T04062001