DeepRead
Cover of Discrete mathematics

Discrete mathematics

Norman Biggs · 1985

Mathematics and physics › Proofs and analysis intro

#8,926 most recommended

About the book

An undergraduate introduction to discrete mathematics, the branch dealing with countable, finite structures, aimed mainly at computer science students. It covers the core topics the field relies on, including sets, logic, relations and functions, counting and combinatorics, graphs and trees, and algebraic structures. The 1985 first edition was followed by revised editions in 1989 and 2002. The book presents discrete mathematics as the foundation that computing depends on, so the mathematical tools need to be learned in their own right. Its method is to build precise definitions and proof techniques alongside worked examples and exercises, rather than treating them as a set of formulas. It makes the case that these ideas are needed for reasoning about algorithms, data structures, and the correctness of software.

Written by Claude from what it knows of this book.

What Hacker News says 100% recommend · 0% critical

0122010201520202010 peak · 1
This bookAverage book in Proofs and analysis intro

In the commenters’ own words

What Open Library readers say 5.00 from 4 ratings

  1. 54
  2. 40
  3. 30
  4. 20
  5. 10
  • 231 want to read
  • 12 reading
  • 4 have read

Only 4 ratings: treat the average as a hint.

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

Details

First published
1985
ISBN
9780198507178
Editions known
14 at Open Library
Open Library
OL3584303W

004/.01/51512/.1Computer scienceComputer science, mathematicsComputer science--mathematicsElectronic data processingInformatiqueInformatique--mathématiquesMathematicsMathématiquesQa76.9.m35 b54 1989Qa76.9.m35 b54 2002

Explore in the mosaic

Read next: its neighbours on the mosaic