4.3 The Division Algorithm: Prime Numbers
4.4 The Greatest Common Divisor: The Euclidean Algorithm
4.5 The Fundamental Theorem of Arithmetic
7.1 Relations Revisited: Properties of Relations
7.2 Computer Recognition: Zero-One Matrices and Directed Graphs
7.3 Partial Orders: Hasse Diagrams
7.4 Equivalence Relations and Partitions
8.1* The Principle of Inclusion and Exclusion
8.2* Generalizations of the Principle
8.3 Derangements: Nothing Is in Its Right Place
8.5 Arrangements with Forbidden Positions
10.1* The First-Order Linear Recurrence Relation
10.2* The Second-Order Linear Homogeneous Recurrence Relation with Constant Coefficients
10.3* The Nonhomogeneous Recurrence Relation
10.4* The Method of Generating Functions
13.1 Dijkstra’s Shortest-Path Algorithm
13.2 Minimal Spanning Trees: The Algorithms of Kruskal and Prim
13.3 Transport Networks: The Max-Flow Min-Cut Theorem
14.1 The Ring Structure: Definition and Examples
14.2 Ring Properties and Substructures
14.4 Ring Homomorphisms and Isomorphisms
16.1 Definition, Examples, and Elementary Properties
16.2 Homomorphisms, Isomorphisms, and CyclicGroups
16.3 Cosets and Lagrange's Theorem
16.4 The RSA Cryptosystem
16.5 Elements of Coding Theory
16.7 The Parity-Check and Generator Matrices
16.8 Group Codes: Decoding with Coset Leaders
16.10 Counting and Equivalence: Burnside's Theorem
16.12 The Pattern Inventory: Polya's Method of Enumeration
17.2* Irreducible Polynomials: Finite Fields
17.4 Finite Geometries and Affine Planes
17.5 Block Designs and Projective Planes