Ferland, Kevin K.,  1969- <br/><br/>
Discrete mathematics and applications / 
Kevin Ferland. 
 - Second edition. 
 - xxviii, 916 pages :  color illustrations ;  27 cm. 
 - Textbooks in mathematics .
<br/><br/> "A Chapman & Hall book."  Kevin Ferland<br/><br/>Professor of Mathematics<br/>Bloomsburg University of PA<br/>Bloomsburg PA USA<br/><br/>Kevin Ferland (MR Author ID: 343376) received his Ph.D. in mathematics from Syracuse University in 1999 and is currently a professor of mathematics at Bloomsburg University.<br/>In addition to his textbook, Discrete Mathematics and Applications, he has published several papers on the toughness of graphs. Kevin also enjoys both pursuing the combinatorics of and doing crossword puzzles. 
<br/><br/>Includes bibliographical references and index. 
<br/><br/>Table of Contents<br/><br/>I Proofs<br/><br/>Logic and Sets<br/><br/>Statement Forms and Logical Equivalences<br/><br/>Set Notation<br/><br/>Quantifiers<br/><br/>Set Operations and Identities<br/><br/>Valid Arguments<br/><br/>Basic Proof Writing<br/><br/>Direct Demonstration<br/><br/>General Demonstration (Part 1)<br/><br/>General Demonstration (Part 2)<br/><br/>Indirect Arguments<br/><br/>Splitting into Cases<br/><br/>Elementary Number Theory<br/><br/>Divisors<br/><br/>Well-Ordering, Division, and Codes<br/><br/>Euclid's Algorithm and Lemma<br/><br/>Rational and Irrational Numbers<br/><br/>Modular Arithmetic and Encryption<br/><br/>Indexed by Integers<br/><br/>Sequences, Indexing, and Recursion<br/><br/>Sigma Notation<br/><br/>Mathematical Induction, An Introduction<br/><br/>Induction and Summations<br/><br/>Strong Induction<br/><br/>The Binomial Theorem<br/><br/>Relations<br/><br/>General Relations<br/><br/>Special Relations on Sets<br/><br/>Basics of Functions<br/><br/>Special Functions<br/><br/>General Set Constructions<br/><br/>Cardinality<br/><br/>II Combinatorics<br/><br/>Basic Counting<br/><br/>The Multiplication Principle<br/><br/>Permutations and Combinations<br/><br/>Addition and Subtraction<br/><br/>Probability<br/><br/>Applications of Combinations<br/><br/>Correcting for Overcounting<br/><br/>More Counting<br/><br/>Inclusion-Exclusion<br/><br/>Multinomial Coe□cients<br/><br/>Generating Functions<br/><br/>Counting Orbits<br/><br/>Combinatorial Arguments<br/><br/>Basic Graph Theory<br/><br/>Motivation and Introduction<br/><br/>Special Graphs<br/><br/>Matrices<br/><br/>Isomorphisms<br/><br/>Invariants<br/><br/>Directed Graphs and Markov Chains<br/><br/>Graph Properties<br/><br/>Connectivity<br/><br/>Euler Circuits<br/><br/>Hamiltonian Cycles<br/><br/>Planar Graphs<br/><br/>Chromatic Number<br/><br/>Trees and Algorithms<br/><br/>Trees<br/><br/>Search Trees<br/><br/>Weighted Trees<br/><br/>Analysis of Algorithms (Part 1)<br/><br/>Analysis of Algorithms (Part 2)<br/><br/>A Assumed Properties of Z and R<br/><br/>B Pseudocode<br/><br/>C Answers to Selected Exercises 
<br/><br/><label>ISBN: </label>9781498730655 (hbk. : acidfree paper) 
<br/><br/><label>LCCN: </label>2016033396 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Mathematics--Textbooks.<br/>Computer science--Mathematics--Textbooks.
<br/><br/><label>LC Class. No.: </label>QA39.3  / .F47 2017 
<br/><br/><label>Dewey Class. No.: </label>511/.1