Download the Free Fishpond App!
Download on the App Store

Android App on Google play

Already own it?

Sell Yours
Home » Books » Computers » Operating Systems » General

Discrete Mathematics and Applications

Textbooks in Mathematics

By Kevin Ferland

or 4 easy payments of $33.25 with What's this?
Free shipping Australia wide
Ships from local warehouse
New or Used: $150.14
Order Now for Christmas with e-Gift
Register or sign-in to rate and get recommendations.
Format: Hardback, 944 pages, 2nd Revised edition Edition
Other Information: 893 black & white illustrations, 196 black & white tables
Published In: United States, 06 April 2017
This book is intended for a one-semester course in discrete mathematics. Such a course is typically taken by mathematics, mathematics education, and computer science majors, usually in their sophomore year. Calculus is not a prerequisite to use this book. Part one focuses on how to write proofs, then moves on to topics in number theory, employing set theory in the process. Part two focuses on computations, combinatorics, graph theory, trees, and algorithms.

Table of Contents

I Proofs Logic and Sets Statement Forms and Logical Equivalences Set Notation Quantifiers Set Operations and Identities Valid Arguments Basic Proof Writing Direct Demonstration General Demonstration (Part 1) General Demonstration (Part 2) Indirect Arguments Splitting into Cases Elementary Number Theory Divisors Well-Ordering, Division, and Codes Euclid's Algorithm and Lemma Rational and Irrational Numbers Modular Arithmetic and Encryption Indexed by Integers Sequences, Indexing, and Recursion Sigma Notation Mathematical Induction, An Introduction Induction and Summations Strong Induction The Binomial Theorem Relations General Relations Special Relations on Sets Basics of Functions Special Functions General Set Constructions Cardinality II Combinatorics Basic Counting The Multiplication Principle Permutations and Combinations Addition and Subtraction Probability Applications of Combinations Correcting for Overcounting More Counting Inclusion-Exclusion Multinomial Coecients Generating Functions Counting Orbits Combinatorial Arguments Basic Graph Theory Motivation and Introduction Special Graphs Matrices Isomorphisms Invariants Directed Graphs and Markov Chains Graph Properties Connectivity Euler Circuits Hamiltonian Cycles Planar Graphs Chromatic Number Trees and Algorithms Trees Search Trees Weighted Trees Analysis of Algorithms (Part 1) Analysis of Algorithms (Part 2) A Assumed Properties of Z and R B Pseudocode C Answers to Selected Exercises

EAN: 9781498730655
ISBN: 1498730655
Publisher: Productivity Press
Dimensions: 25.4 x 17.8 centimetres (2.02 kg)
Age Range: 15+ years
Tell a friend

Their Email:

Sell Yours

Already own this item?
Sell Yours and earn some cash. It's fast and free to list! (Learn More.)

Review this Product


Related Searches


Webmasters, Bloggers & Website Owners

You can earn a 5% commission by selling Discrete Mathematics and Applications (Textbooks in Mathematics) on your website. It's easy to get started - we will give you example code. After you're set-up, your website can earn you money while you work, play or even sleep!



Are you the Author/Publisher? Improve sales by submitting additional information on this title.