What sort of mathematics do I need for computer science? In response, a pair of professors at the University of California at San Diego created this text. Explores Boolean functions and computer arithmetic; logic; number theory and cryptography; sets and functions; equivalence and order; and induction, sequences, and series. Assumes some familiarity with calculus. Original 2005 edition. Dover Original.
Like free samples?Click here to get new ones every week.
Foundations of Combinatorics with Applications by Edward A. Bender, S. Gill Williamson Suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics, this introductory text explores counting and listing, graphs, induction and recursion, and generating functions. Includes numerous exercises (some with solutions), notes, and references.