Discrete MathematicsFocused on helping readers understand and construct proofs – and, generally, expanding their mathematical maturity – this bestseller is an accessible introduction to discrete mathematics. Takes an algorithmic approach that emphasizes problemsolving techniques. Expands discussion on how to construct proofs and treatment of problem solving. Increases number of examples and exercises throughout. 
What people are saying  Write a review
User ratings
5 stars 
 
4 stars 
 
3 stars 
 
2 stars 
 
1 star 

LibraryThing Review
User Review  sloDavid  LibraryThingWhy is this book so tall? Good grief, it's like a notebook. I guess it's easier to fit into one's backpack though. Introduces all the basic concepts of the "science" of computer science. Logic ... Read full review
may i know how much does this book costs in the market
Contents
Sets and Logic  1 
Proofs  66 
This section can be omitted without loss of continuity  117 
Copyright  
17 other sections not shown
Common terms and phrases
References to this book
Discrete Algorithmic Mathematics, Third Edition Stephen B. Maurer,Anthony Ralston No preview available  2004 