Discrete Mathematics

This Book Provides A Carefully Structured, Coherent, And Comprehensive Course Of Discrete Mathematics. The Clarity Of The Exposition, And The Scope Of The Contents Has Made It A Popular Choice For Students And Teachers Of Mathematics, Computer Science, Operational Research, And Related Subjects. The Topics Covered Include The Elements Of Graph Theory, Combinatorics, Number Theory, The Theory Of Algorithms, Abstract Algebra, And Coding Theory.--book Jacket. Pt. I. Foundations. 1. Statements And Proofs. 2. Set Notation. 3. The Logical Framework. 4. Natural Numbers. 5. Functions. 6. How To Count. 7. Integers. 8. Divisibility And Prime Numbers. 9. Fractions And Real Numbers -- Pt. Ii. Techniques. 10. Principles Of Counting. 11. Subsets And Designs. 12. Partition, Classification, And Distribution. 13. Modular Arithmetic -- Pt. Iii. Algorithms And Graphs. 14. Algorithms And Their Efficiency. 15. Graphs. 16. Trees, Sorting, And Searching. 17. Bipartite Graphs And Matching Problems. 18. Digraphs, Networks, And Flows. 19. Recursive Techniques -- Pt. Iv. Algebraic Methods. 20. Groups. 21. Groups Of Permutations. 22. Rings, Fields, And Polynomials. 23. Finite Fields And Some Applications. 24. Error-correcting Codes. 25. Generating Functions. 26. Partitions Of A Positive Integer. 27. Symmetry And Counting. Norman L. Biggs. Includes Index.