商品描述
编辑**
《经典原版书库:离散数学及其应用(英文版·第7版)》可作为1-2个学期的离散数学课程教材，实用于数学、计算机科学、计算机工程、信息技术专业的学生。
作者简介
作者：（美国）罗森（Kenneth H.Rosen）

罗森（Kenneth H.Rosen），于1972年获密歇根大学数学学士学位，1976年获麻省理工学院数学博士学位，其博士论文研究的是数论，导师是Harold Stark。曾就职于科罗拉多大学、俄亥俄州立大学、缅因大学，后加盟贝尔实验室，现为AT＆T实验室特别成员。他目前还是蒙茅斯大学客座研究教授，教授“离散数学”、“编码理论”和“数据**”课程。此外，他还是CRC出版社离散数学丛书的编辑顾问。Rosen博士在专业期刊上发表过许多关于数论及数学建模的文章。《初等数论及其应用》和《离散数学及其应用》这两本书均被国际上几百所大学广为采用。

Preface
About the Author
The Companion Website
To the Student
List of Symbols
1 The Foundations: Logic and Proofs
1.1 Propositional Logic
1.2 Applications of Propositional Logic
1.3 Propositional Equivalences
1.4 Predicates and Quantifiers
1.5 Nested Quantifiers
1.6 Rules of Inference
1.7 Introduction to Proofs
1.8 Proof Methods and Strategy
End-of-Chapter Material
2 Basic Structures: Sets, Functions, Sequences, SumS, and Matrices
2.1 Sets
2.2 Set Operations
2.3 Functions
2.4 Sequences and Summations
2.5 Cardinality of Sets
2.6 Matrices
End-of-Chapter Material
3 Algorithms
3.1 Algorithms
3.2 The Growth of Functions
3.3 Complexity of Algorithms
End-of-Chapter Material
4 Number Theory and Cryptography
4.1 Divisibility and Modular Arithmetic
4.2 Integer Representations and Algorithms
4.3 Primes and Greatest Common Divisors
4.4 Solving Congruences
4.5 Applications of Congruences
4.6 Cryptography
End-of-Chapter Material
5 Induction and Recursion
5.1 Mathematical Induction
5.2 Strong Induction and Well-Ordering
5.3 Recursive Definitions and Structural Induction
5.4 Recursive Algorithms
5.5 Program Correctness
End-of-Chapter Material
6 Counting
6.1 The Basics of Counting
6.2 The Pigeonhole Principle
6.3 Permutations and Combinations
6.4 Binomial Coefficients and Identities
6.5 Generalized Permutations and Combinations
6.6 Generating Permutations and Combinations
End-of- Chapter Material
7 Discrete Probability
7.1 An Introduction to Discrete Probability
7.2 Probability Theory
7.3 Bayes'Theorem
7.4 Expected Value and Variance
End-of-Chapter Material
8 Advanced Counting Techniques
8.1 Applications of Recurrence Relations
8.2 Solving Linear Recurrence Relations
8.3 Divide-and-Conquer Algorithras and Recurrence Relations
8.4 Generating Functions
8.5 Inclusion-Exclusion
8.6 Applications of Inclusion-Exclusion
End-of-Chapter Material
9 Relations
9. 1 Relations and Their Properties
9.2 n-ary Relations and Their Applications
9.3 Representing Relations
9.4 Closures of Relations
9.5 Equivalence Relations
9.6 Partial Orderings
End-of-Chapter Material
10 Graphs
10.1 Graphs and Graph Models
10.2 Graph Terminology and Special Types of Graphs
10.3 Representing Graphs and Graph Isomorphism
10.4 Connectivity
10.5 Euler and Hamilton Paths
10.6 Shortest-Path Problems
10.7 Planar Graphs
10.8 Graph Coloring
End-of-Chapter Material
11 Trees
11.1 Introduction to Trees
11.2 Applications of Trees
11.3 Tree Traversal
11.4 Spanning Trees
11.5 Minimum Spanning Trees
End-of-Chapter Material
12 Boolean Algebra
12.1 Boolean Functions
12.2 Representing Boolean Functions
12.3 Logic Gates
12.4 Minimization of Circuits
End-of-Chapter Material
13 Modeling Computation
13.1 Languages and Grammars
13.2 Finite-State Machines with Output
13.3 Finite-State Machines with No Output
13.4 Language Recognition
13.5 Turing Machines
End-of-Chapter Material
Appendixes
1 Axioms for the Real Numbers and the Positive Integers
2 Exponential and Logarithmic Functions
3 Pseudocode
Suggested Readings B-1
Answers to Odd-Numbered Exercises S-1
Photo Credits C-1
Index of Biographies I-1
Index I-2