skip to content
Discrete mathematics with combinatorics Preview this item
ClosePreview this item

Discrete mathematics with combinatorics

Author: James A Anderson
Publisher: Upper Saddle River, New Jersey : Prentice Hall, 2001
Edition/Format:   Print book : EnglishView all editions and formats

Suitable for freshman-level, one- or two-semester courses in Discrete Mathematics, this book covers various topics in discrete mathematics in a logical fashion. Placing each topic in context, it  Read more...


(not yet rated) 0 with reviews - Be the first.

More like this


Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...


Document Type: Book
All Authors / Contributors: James A Anderson
ISBN: 0130869988 9780130869982
OCLC Number: 474291525
Description: xiv, 807 s.
Contents: 1. Truth Tables, Logic, and Proofs. Statements and Connectives. Conditional Statements. Equivalent Statements. Axiomatic Systems: Arguments and Proofs. Completeness in Propositional Logic. Karnaugh Maps. Circuit Diagrams. 2. Set Theory. Introduction to Sets. Set Operations. Venn Diagrams. Boolean Algebras. Relations. Partially Ordered Sets. Equivalence Relations. 3. Logic, Integers, and Proofs. Predicate Calculus. Basic Concepts of Proofs and the Structure of Integers. Mathematical Induction. Divisibility. Prime Integers. Congruence Relations. 4. Functions and Matrices. Functions. Special Functions. Matrices. Cardinality. Cardinals Continued. 5. Algorithms and Recursion. The "for" Procedure and Algorithms for Matrices. Recursive Functions and Algorithms. Complexity of Algorithms. Sorting Algorithms. Prefix and Suffix Notation. Binary and Hexadecimal Numbers. Signed Numbers. Matrices Continued. 6. Graphs, Directed Graphs, and Trees. Graphs. Directed Graphs. Trees. Instant Insanity. Euler Paths and Cycles. Incidence and Adjacency Matrices. Hypercubes and Gray Code. 7. Number Theory. Sieve of Eratosthenes. Fermat's Factorization Method. The Division and Euclidean Algorithms. Continued Fractions. Convergents. 8. Counting and Probability. Basic Counting Principles. Inclusion-Exclusion Introduced. Permutations and Combinations. Generating Permutations and Combinations. Probability Introduced. Generalized Permutations and Combinations. Permutations and Combinations with Repetition. Pigeonhole Principle. Probability Revisited. Bayes' Theorem. Markov Chains. 9. Algebraic Structures. Partially Ordered Sets Revisited. Semigroups and Semilattices. Lattices. Groups. Groups and Homomorphisms. 10. Number Theory Revisited. Integral Solutions of Linear Equations. Solutions of Congruence Equations. Chinese Remainder Theorem. Properties of the Function. Order of an Integer. 11. Recursion Revisited. Homogeneous Linear Recurrence Relations. Nonhomogeneous Linear Recurrence Relations. Finite Differences. Factorial Polynomials. Sums of Differences. 12. Counting Continued. Occupancy Problems. Catalan Numbers. General Inclusion-Exclusion and Derangements. Rook Polynomials and Forbidden Positions. 13. Generating Functions. Defining the Generating Function (optional). Generating Functions and Recurrence Relations. Generating Functions and Counting. Partitions. Exponential Generating Functions. 14. Graphs Revisited. Algebraic Properties of Graphs. Planar Graphs. Coloring Graphs. Hamiltonian Paths and Cycles. Weighted Graphs and Shortest Path Algorithms. 15. Trees. Properties of Trees. Binary Search Trees. Weighted Trees. Traversing Binary Trees. Spanning Trees. Minimal Spanning Trees. 16. Networks. Networks and Flows. Matching. Petri Nets. 17. Theory of Computation. Regular Languages. Automata. Grammars. 18. Theory of Codes. Introduction. Generator Matrices. Hamming Codes. 19. Enumeration of Colors. Burnside's Theorem. Polya's Theorem. 20. Rings, Integral Domains, and Fields. Rings and Integral Domains. Integral Domains. Polynomials. Algebra and Polynomials. 21. Group and Semigroup Characters. Complex Numbers. Group Characters. Semigroup Characters. 22. Applications of Number Theory. Application: Pattern Matching. Application: Hashing Functions. Application: Cryptography. Bibliography. Hints and Solutions to Selected Exercises. Index.
Responsibility: James A. Anderson


User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...


Be the first.

Similar Items

Related Subjects:(2)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data

Primary Entity

<> # Discrete mathematics with combinatorics
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "474291525" ;
   library:placeOfPublication <> ;
   library:placeOfPublication <> ; # Upper Saddle River, New Jersey
   schema:about <> ; # Combinatorial analysis
   schema:about <> ; # Mathematics
   schema:bookFormat bgn:PrintBook ;
   schema:creator <> ; # James A. Anderson
   schema:datePublished "2001" ;
   schema:exampleOfWork <> ;
   schema:inLanguage "en" ;
   schema:name "Discrete mathematics with combinatorics" ;
   schema:productID "474291525" ;
   schema:publication <> ;
   schema:publisher <> ; # Prentice Hall
   schema:workExample <> ;
   wdrs:describedby <> ;

Related Entities

<> # Prentice Hall
    a bgn:Agent ;
   schema:name "Prentice Hall" ;

<> # James A. Anderson
    a schema:Person ;
   schema:familyName "Anderson" ;
   schema:givenName "James A." ;
   schema:name "James A. Anderson" ;

<> # Upper Saddle River, New Jersey
    a schema:Place ;
   schema:name "Upper Saddle River, New Jersey" ;

<> # Combinatorial analysis
    a schema:Thing ;
   schema:name "Combinatorial analysis" ;

    a schema:ProductModel ;
   schema:isbn "0130869988" ;
   schema:isbn "9780130869982" ;

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.