DeepRead
Cover of Discrete Mathematics

Discrete Mathematics

Kenneth H. Rosen · 1999

Mathematics and physics › Proofs and analysis intro

#11,221 most recommended

About the book

Discrete mathematics: the study of mathematical structures built from distinct, countable elements rather than continuous quantities. The book covers logic, sets, functions, algorithms, integers and number theory, induction and recursion, counting, discrete probability, relations, graphs, trees, and Boolean algebra. It is written as an undergraduate introduction for students of computer science and mathematics. The book presents discrete mathematics as the working language of computing, so that proof techniques such as direct proof, contradiction, and induction are treated as tools for reasoning about algorithms and data structures. It holds that discrete structures like graphs, relations, and recurrences model real systems such as networks, databases, and programs. It also argues that counting and probability are needed to analyze how efficient an algorithm is.

Written by Claude from what it knows of this book.

What Hacker News says 67% recommend · 0% critical

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

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 1 want to read
  • 0 reading
  • 0 have read

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

The threads it came up in

Details

First published
1999
ISBN
9780072366570
Editions known
2 at Open Library
Open Library
OL33673811W

Explore in the mosaic

Read next: its neighbours on the mosaic