Edition: 2nd 2002 (Revised)
List price: $85.00
Buy it from $45.66
This item qualifies for FREE shipping
*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.
30 day, 100% satisfaction guarantee
If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.
Learn more about our returns policy
Description: 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.
Rush Rewards U
You have reached 400 XP and carrot coins. That is the daily max!
Limited time offer:
Get the first one free!
All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.
List price: $85.00
Copyright year: 2002
Publisher: Oxford University Press, Incorporated
Publication date: 2/20/2003
Size: 7.50" wide x 10.00" long x 1.00" tall
|Numbers And Counting|
|Functions and counting|
|Principles of counting|
|Subsets and designs|
|Partition, classification, and distribution|
|Graphs And Algorithms|
|Algorithms and their efficiency|
|Trees, sorting, and searching|
|Bipartite graphs and matching problems|
|Digraphs, networks, and flows|
|Groups of permutations|
|Rings, fields, and polynomials|
|Finite fields and some applications|
|Partitions of a positive integer|
|Symmetry and counting|