Skip to content

Discrete Mathematics

ISBN-10: 0618415386

ISBN-13: 9780618415380

Edition: 2009

Authors: Kevin Ferland

List price: $256.95
Blue ribbon 30 day, 100% satisfaction guarantee!
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!


Discrete Mathematics combines a balance of theory and applications with mathematical rigor and an accessible writing style. The author uses a range of examples to teach core concepts, while corresponding exercises allow students to apply what they learn. Throughout the text, engaging anecdotes and topics of interest inform as well as motivate learners. The text is ideal for one- or two-semester courses and for students who are typically mathematics, mathematics education, or computer science majors. Part I teaches student how to write proofs; Part II focuses on computation and problem solving. The second half of the book may also be suitable for introductory courses in combinatorics and graph theory.
Customers also bought

Book details

List price: $256.95
Copyright year: 2009
Publisher: CENGAGE Learning
Publication date: 2/5/2008
Binding: Hardcover
Pages: 720
Size: 8.25" wide x 10.25" long x 1.25" tall
Weight: 3.564
Language: English

Representing Numbers
Logic and Sets
Statement Forms and Logical Equivalences
Set Notation
Set Operations and Identities
Valid Arguments
Review Problems
Basic Proof Writing
Direct Demonstration
General Demonstration (Part 1)
General Demonstration (Part 2)
Indirect Arguments
Splitting into Cases
Review Problems
Elementary Number Theory
Consequences of Well-Ordering
Euclid's Algorithm and Lemma
Rational Numbers
Irrational Numbers
Modular Arithmetic
Review Problems
Indexed by Integers
Sequences, Indexing, and Recursion
Sigma Notation
Mathematical Induction, an Introduction
Induction and Summations
Strong Induction
The Binomial Theorem
Review Problems
General Relations
Special Relations on Sets
Basics of Functions
Special Functions
General Set Constructions
Review Problems
Basic Counting
The Multiplication Principle
Permutations and Combinations
Addition and Subtraction
Applications of Combinations
Correcting for Overcounting
Review Problems
More Counting
Multinomial Coefficients
Generating Functions
Counting Orbits
Combinatorial Arguments
Review Problems
Basic Graph Theory
Motivation and Introduction
Matrices and Special Graphs
Directed Graphs and Markov Chains
Review Problems
Graph Properties
Euler Circuits
Hamiltonian Cycles
Planar Graphs
Chromatic Number
Review Problems
Trees and Algorithms
Search Trees
Weighted Trees
Analysis of Algorithms (Part 1)
Analysis of Algorithms (Part 2)
Review Problems
Assumed Properties of Z and R