Mathematics A Discrete Introduction
Edition: 2nd 2006
List price: $257.95
Buy it from $9.83
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: Master the fundamentals of discrete mathematics and proof-writing with MATHEMATICS: A DISCRETE INTRODUCTION! With a wealth of learning aids and a clear presentation, the mathematics text teaches you not only how to write proofs, but how to think clearly and present cases logically beyond this course. Though it is presented from a mathematician's perspective, you will learn the importance of discrete mathematics in the fields of computer science, engineering, probability, statistics, operations research, and other areas of applied mathematics. Tools such as Mathspeak, hints, and proof templates prepare you to succeed in this course.
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: $257.95
Copyright year: 2006
Publication date: 6/6/2005
Size: 7.25" wide x 9.00" long x 0.75" tall
|Sets I: Introduction, Subsets|
|Sets II: Operations|
|Combinatorial Proof: Two Examples|
|Counting And Relations|
|The Pigeonhole Principle|
|Conditional Probability and Independence|
|Greatest Common Divisor|
|The Chinese Remainder Theorem|
|Fermat's Little Theorem|
|Public-Key Cryptography I: Introduction|
|Public-Key Cryptography II: Rabin's Method|
|Public-Key Cryptography III: RSA|
|Graph Theory Fundamentals|
|Partially Ordered Sets|
|Partially Ordered Sets Fundamentals|
|Max and Min|
|Lots of Hints and Comments; Some Answers|
|Solutions to Self Tests|