Discrete Mathematics and Its Applications

Key differences between 7th and 6th editions

• Period between current and previous publications: 5 years (2011 vs 2006).
• Rosen's Discrete Mathematics text was first published in 1988.
• Key changes to the Seventh Edition:
• The Seventh Ed. is organized into 13 chapters.
• Chapter 1:
• New section 1.2 Applications of Propositional Logic covers translation of English sentences, web search and Boolean searches, solving of logic puzzles, design of digital circuits.
• Proposed template for proofs by induction
• Chapter 2:
• New section 2.5 Cardinality of Sets covers countable and uncountable sets, Hilbert's paradox of the Grand Hotel, continuum hypothesis.
• Information from the former chapter 3 "The Fundamentals: Algorithms, the Integers, and Matrices" has been expanded and divided into two separate chapters 3 "Algorithms" and 4 "Number Theory and Cryptography".
• Chapter 3: Provides useful rules for big-O estimates of logarithms, powers, and exponential functions.
• New Chapter 4:
• New section 4.6 "Cryptography" covers cryptanalysis (the process of breaking codes, ciphers, and cryptosystems); public key cryptosystems; RSA cryptosystem, invented by Ronald Rivest, Adi Shamir, and Leonard Adleman; encryption and decryption of RSA; Diffie-Hellman key agreement protocol and digital signatures.
• Chapter 10:
• Matching in bipartite graphs, including Hall's Marriage Theorem
• Vertex connectivity, edge connectivity, and n-connectedness
• Application of graphs to the biological sciences, including niche-overlap graphs in ecological networks, protein-protein interaction networks.