Discrete Mathematics, 2/Ed > 이산수학

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
Answers to exercises
Index