Sorry, this item is not available in
Image not available for
Color:
Image not available

To view this video download Flash Player

 


or
Sign in to turn on 1-Click ordering
Sell Us Your Item
For a $12.56 Gift Card
Trade in
More Buying Choices
Have one to sell? Sell yours here
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Discrete Mathematics [Paperback]

Norman L. Biggs
3.2 out of 5 stars  See all reviews (6 customer reviews)

Buy New
$68.34 & FREE Shipping. Details
Rent
$22.00
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.
In Stock.
Want it Monday, July 14? Choose One-Day Shipping at checkout. Details
Free Two-Day Shipping for College Students with Amazon Student

Formats

Amazon Price New from Used from
Hardcover --  
Paperback $68.34  
Unknown Binding --  
Shop the New Digital Design Bookstore
Check out the Digital Design Bookstore, a new hub for photographers, art directors, illustrators, web developers, and other creative individuals to find highly rated and highly relevant career resources. Shop books on web development and graphic design, or check out blog posts by authors and thought-leaders in the design industry. Shop now

Book Description

February 20, 2003 0198507178 978-0198507178 2
The long-awaited second edition of Norman Bigg's best-selling Discrete Mathematics, includes new chapters on statements and proof, logical framework, natural numbers, and the integers, in addition to updated chapters from the previous edition. Carefully structured, coherent and comprehensive, each chapter contains tailored exercises and solutions to selected questions, and miscellaneous exercises are presented throughout. This is an invaluable text for students seeking a clear introduction to discrete mathematics, graph theory, combinatorics, number theory and abstract algebra.

Frequently Bought Together

Discrete Mathematics + Schaum's Outline of Probability, Second Edition (Schaum's Outline Series)
Price for both: $81.10

Buy the selected items together


Editorial Reviews

Review

`For the Second Edition: "... it is a wonderful book. Biggs' expository style is of the highest quality." ' Professor James Reid, University of Mississippi

`"... a well written book by a world-renowned expert. The explanations go to the heart of the matter and the proofs given are elegant." ' Professor Mohan Shrikhande, University of Michigan

`" the material is well written in a clear and lucid style ... " ' Dr Jim Renshaw, University of Southampton

`the new chapters are elegantly written' Dr Peter Robinson, University of Cambridge

`From recent reviews of the first edition: "Biggs' book ... a timely and important addition to the literature ... stands out for its clarity of exposition, its careful organization, and for the way in which it reduces unnecessary abstraction to a minimum ... The range of topics covered is astonishing ... and ... it is written with humour and a lightness of touch which make it a pleasure to read." ' Times Higher Education Supplemement

`"It seems to me that the book is as comprehensive as one could hope. I strongly recommend it" ' Bulletin of the London Mathematical Society

`"the comprehensive course of discrete mathematics" ' L'Enseignement Mathematique, t.36, fasc.1-2, 1990

About the Author

Norman Biggs is a Professor of Mathematics, London School of Economics, University of London.

Product Details

  • Series: Mathematics
  • Paperback: 440 pages
  • Publisher: Oxford University Press; 2 edition (February 20, 2003)
  • Language: English
  • ISBN-10: 0198507178
  • ISBN-13: 978-0198507178
  • Product Dimensions: 0.9 x 6.5 x 9.2 inches
  • Shipping Weight: 15.2 ounces (View shipping rates and policies)
  • Average Customer Review: 3.2 out of 5 stars  See all reviews (6 customer reviews)
  • Amazon Best Sellers Rank: #490,655 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

3.2 out of 5 stars
(6)
3.2 out of 5 stars
Share your thoughts with other customers
Most Helpful Customer Reviews
15 of 16 people found the following review helpful
4.0 out of 5 stars great book April 25, 2002
By A Customer
Format:Hardcover
Dr. Biggs' book is an excellent introduction to discrete maths--I used it for the first term and part of the second term of his "Introduction to Pure Maths". The book reads the same as he lectures, which, while sometimes creepy (it's like he's talking to you), is a very good thing. It is very well written and explains everything clearly. He has plenty of worked examples to illustrate how to use what he has taught as well as exercises (w/ answers in the back of the book) for students to work out for themselves.
Comment | 
Was this review helpful to you?
8 of 10 people found the following review helpful
1.0 out of 5 stars Unthorough, Inadequate for Early Learners March 15, 2010
Format:Paperback
This was the required text in a course I just took in discrete mathematics, and it is very lacking. The descriptions are not detailed enough for first-time learners of the material. Biggs tries to cover very many topics, and as such, doesn't cover any given topic thoroughly. The book feels like random snapshots of various components of discrete mathematics, but not all of the snapshots are representative of the topics to which they belong.

For one group of chapters, Biggs discusses things which are only really relevant or applicable in computer science (or, at the very least, given a computer). This is to be expected - discrete mathematics and computer science go hand in hand. Unfortunately, though, it does not appear that he is a practicing computer scientist - he omits the names behind some of the famous algorithms, i.e. Dijkstra's shortest path algorithm and Prim's minimum spanning tree algorithm. He ditches the minimum spanning tree problem and proceeds to DFS without discussing Kruskal's algorithm. He also performs heap sort with a min order heap, sorting elements in ascending order, which, as most computer science students should be able to recognize, requirs linear-order extra space in order to copy the final array (as opposed to using a max-order heap, which requires only constant space). He uses a seemingly FORTRAN-based pseudocode, but omits symbols, adds more English words (as if FORTRAN didn't have enough), and uses no comments.

All in all, avoid this book if possible. For introductory-level discrete mathematics, I would recommend Discrete Mathematics and Its Applications, which still sits on my shelf and serves as a great quick reference.
Read more ›
Was this review helpful to you?
1 of 1 people found the following review helpful
5.0 out of 5 stars Interesting book October 29, 2010
Format:Paperback|Verified Purchase
I bought this book for my first year at university. It is a good book, clear and concise, and altought I bought a used one (second edition) it was like a new one, so I'm very happy. :)
Comment | 
Was this review helpful to you?





Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

Forums

There are no discussions about this product yet.
Be the first to discuss this product with the community.
Start a new discussion
Topic:
First post:
Prompts for sign-in
 



Look for Similar Items by Category