Discrete Mathematics combines a balance of theory and applications with mathematical rigor and an accessible writing style. The author uses a range of examples to teach core concepts, while corresponding exercises allow students to apply what they learn. Throughout the text, engaging anecdotes and topics of interest inform as well as motivate learners. The text is ideal for one- or two-semester courses and for students who are typically mathematics, mathematics education, or computer science majors. Part I teaches student how to write proofs; Part II focuses on computation and problem solving. The second half of the book may also be suitable for introductory courses in combinatorics and graph theory.
AI Reading Assistant
Whole-book reading guide from stratified index samples; jump to passages in the text
Tip the Site
Support this siteYour recognition and a small knowledge-service contribution help keep this technical work open source.Scan the WeChat Pay or Alipay code below. Logged-in and guest visitors can both tip.
WeChat Pay
Alipay
Open WeChat or Alipay and scan. No login required.
AI guide
【One-Line Pitch】
A rigorous but readable introduction to discrete mathematics that teaches you to write proofs first and then uses those skills to tackle number theory, combinatorics, and graph theory. Best suited to mathematics and computer science majors who want a foundation that will actually hold up in later courses.
【Book Arc】
- **Opening (~0%–10%)**: Establishes the representational and logical groundwork — binary, octal, and hexadecimal number systems, truth tables, logical equivalence, quantifiers, and the basics of naive set theory (including Russell's Paradox and the Subset Axiom). This stage solves the problem of giving readers a shared vocabulary and a precise language for statements before any proof is attempted.
- **Early (~10%–32%)**: The heart of Part I — basic proof writing. Covers direct proof, contrapositive, contradiction, and biconditionals, always driven by definitions (e.g., proving a constant function is periodic, or that A ∩ B ⊆ A). This stage solves the central pedagogical problem of the book: turning students who can compute into students who can justify.
- **Middle (~32%–50%)**: Elementary number theory built on the proof toolkit — divisibility, the Division Algorithm, gcd/lcm, modular arithmetic, rational and irrational numbers, primes, and applications such as ISBN checks and RSA-style encryption. This stage shows proofs doing real work in computation and cryptography.
- **Late (~50%–75%)**: The transition into Part II — computation and problem solving, with combinatorics (counting, permutations, combinations) and the beginnings of graph theory. The excerpts thin out here, but the blurb confirms this half can stand alone as an introductory combinatorics/graph theory course.
- **Ending (~75%–100%)**: Advanced combinatorics and graph theory topics, presumably including recurrence relations, inclusion–exclusion, and graph properties. The excerpts do not cover this final stretch in detail, so treat this stage as the book's "second course" payoff rather than something this guide can map precisely.
【Key Takeaways】
- **Proof writing is the book's first-class citizen** (Early): Part I is explicitly dedicated to teaching how to write proofs, with direct proof, contrapositive, contradiction, and biconditional strategies each given dedicated treatment. This is the book's distinguishing feature versus computation-first discrete math texts.
- **Definitions drive proofs** (Early): The text repeatedly emphasizes that before proving anything, you must unpack the formal definition of every term involved — e.g., knowing what "f² is constant" means before proving it. This is a transferable habit, not just a chapter gimmick.
- **Logic is taught through truth tables and equivalence** (Opening): Converse, contrapositive, inverse, and negation are distinguished carefully, with the contrapositive equivalence (p → q ≡ ¬q → ¬p) flagged as a tool exploited later in proof writing. The programmer's example ("syntax error → no compile") makes the abstraction concrete.
- **Number systems connect to computer science immediately** (Opening): Binary, octal, and hexadecimal conversion is taught via repeated division, with the general base-s procedure stated and later proved. This grounds abstraction in something CS students already care about.
- **Number theory is applied, not just proved** (Middle): Modular arithmetic is tied to ISBN checksums, RSA decryption, and divisibility puzzles (can-stacking lcm problems, box-packing ceiling problems). The exercises consistently ask "what is this for?" alongside "prove it."
- **Set theory is handled with care about paradoxes** (Opening): Russell's Paradox and the Librarian's Dilemma are presented, then the Subset Axiom is introduced to keep the naive set theory safe for the book's purposes. Readers get a honest glimpse of foundational issues without being derailed.
- **Exercises are the real curriculum** (throughout): The excerpted exercise sets are extensive and varied — negating quantified statements, disproving false universals, constructing circuits from Boolean expressions, and multi-part applied problems. The book expects you to work, not just read.
【Reading Tips】
- **Deep-read Part I (through ~32%) even if you've seen proofs before.** The proof-writing chapters are the book's spine; skimming them undermines everything later. Do the exercises — especially the "prove or disprove" ones, which train judgment.
- **Skim the number-base material in Chapter 0 if you're already comfortable with binary/hex.** It's foundational but not where the book's value lies; return to it only if a later section assumes it.
- **Treat the number theory chapter as a bridge, not a destination.** The RSA and ISBN applications are worth understanding, but the real payoff is seeing proof techniques deployed on concrete arithmetic.
- **Use the second half as a standalone combinatorics/graph theory course if that's your goal.** The blurb explicitly says it can serve that purpose; don't feel obligated to march through Part I first if your interest is purely combinatorial.
- **Watch for the "definition first" pattern in every proof.** When you get stuck, go back and write out the formal definition of every term in the statement — the book models this constantly.
【Coverage Limits】
The excerpts are heavily weighted toward the opening and early chapters (logic, sets, proof writing, elementary number theory); the combinatorics and graph theory portions of Part II are only gestured at via the blurb and are not substantively covered here. Specific chapter titles and the exact contents of the final quarter are not verifiable from the provided material.
Page 13
ystem represents numbers in base eight, and the hexadecimal system uses base sixteen. By using the appropriate value of the base s, we can determine the valu...
is at first impossible. 34. All students take calculus. 35. There is no such thing as bad publicity. 36. For everything there is a season. 37. The definition...
and nonincreasing. 28. Let f be a nonnegative real function. Show: f is periodic if and only if f 2 is periodic. 29. Let A and B be sets. Show: A2 = B2 if an...
√ 2 2 is irrational. Conclude that tan(22.5◦) is irrational. 28. Using the identity cos2( +cos(2θ ) θ ) = 1 2 for θ = 15◦, we get 1+ cos(30◦) √ √ √ 3 2+ 3 co...
ing of t∑he Fibonacci sequence can be easily obtained. n 35. Show: ∀ n ≥ 0, Fi = Fn+2 − 1. That is, the sum of any initial string of i=0 the Fibonacci sequen...
. (a) [a ]10 → [a ]5. (b) [a ]5 → [2a ]10. (b) [a ]10 → [ a 2 ]5. 15. Tamera’s boss promised that employee salaries would be a function of how hard the emplo...
ices. For each of the last four slots, there are 10 choices. Moreover, the choice for each slot is independent of the choices for the other slots. Hence, the...
consist of 3 letters (A to Z) followed by 4 digits (0 to 9). If all possible plates are equally likely to be chosen, then 342 P A R T II ■ Combinatorics (b)...
Support this siteYour recognition and a small knowledge-service contribution help keep this technical work open source.
Scan the WeChat Pay or Alipay code below. Logged-in and guest visitors can both tip.
WeChat PayAlipay
Open WeChat or Alipay and scan. No login required.
Add Tag
Enter tag name (max 50 characters)
Share E-Book
Discrete Mathematics An Introduction to Proofs and Combinatorics (Kevin Ferland)(Z-Library)
Scan QR code with your phone to access
Copy the link or scan the QR code to access this e-book on your phone
Share to WeChat Moments
Discrete Mathematics An Introduction to Proofs and Combinatorics (Kevin Ferland)(Z-Library)
Scan the QR code with WeChat to open this book
Tap the ··· menu in the top-right corner
Choose Share to Moments
You are already in WeChat. Tap ··· in the top-right corner and choose Share to Moments.
Share E-Book via Email
Please enter email address
Donation Statistics
¥.00
Total Donations
0
Donation Count
Discrete Mathematics An Introduction to Proofs and Combinatorics (Kevin Ferland)(Z-Library)
Find Your Favorite Books
Only registered users can comment after logging in. Comments need to be reviewed by administrators before being displayed
Loading comments...
Reply to Comment
Edit Comment