Share E-Book
Scan to open this page

Scan with your phone to open this page

Author: W. D. Wallis

Rating 4.0 AI initial rating

Wallis's book on discrete mathematics is a resource for an introductory course in a subject fundamental to both mathematics and computer science, a course that is expected not only to cover certain specific topics but also to introduce students to important modes of thought specific to each discipline... Lower-division undergraduates through graduate students. —Choice reviews (Review of the First Edition) Very appropriately entitled as a 'beginner's guide', this textbook presents itself as the first exposure to discrete mathematics and rigorous proof for the mathematics or computer science student. —Zentralblatt Math (Review of the First Edition) This second edition of A Beginner’s Guide to Discrete Mathematics presents a detailed guide to discrete mathematics and its relationship to other mathematical subjects including set theory, probability, cryptography, graph theory, and number theory. This textbook has a distinctly applied orientation and explores a variety of applications. Key Features of the second edition: * Includes a new chapter on the theory of voting as well as numerous new examples and exercises throughout the book * Introduces functions, vectors, matrices, number systems, scientific notations, and the representation of numbers in computers * Provides examples which then lead into easy practice problems throughout the text and full exercise at the end of each chapter * Full solutions for practice problems are provided at the end of the book This text is intended for undergraduates in mathematics and computer science, however, featured special topics and applications may also interest graduate students.

AI Reading Assistant

Whole-book reading guide from stratified index samples; jump to passages in the text

AI guide
【One-Line Pitch】 A patient, example-driven first course in discrete mathematics that teaches proof and abstraction through concrete applications—ideal for undergraduates in mathematics or computer science who want a gentle but rigorous entry point, and useful for graduate students seeking a refresher on foundational topics. 【Book Arc】 - **Opening (~0%–10%)**: Establishes the number systems (integers, rationals, reals), divisibility, primes, and sigma notation—grounding readers in the arithmetic vocabulary and notation the rest of the book depends on. - **Early (~10%–30%)**: Introduces binary representation and two's complement arithmetic, then moves into propositional logic, truth tables, set theory, cartesian products, and mathematical induction—the core toolkit of rigorous reasoning. - **Early–Middle (~30%–40%)**: Develops Boolean algebra, normal forms, Karnaugh maps, and digital circuits, connecting abstract algebra to how computers actually perform arithmetic with switches and wires. - **Middle (~40%–50%)**: Treats relations and functions formally—equivalence classes, inverses, one-to-one and onto mappings—bridging set theory to the counting and probability that follow. - **Middle–Late (~50%–80%)**: Covers counting principles (multiplication rule, sample spaces), probability, and number theory applications including cryptography—the applied heart of the book. - **Late–Ending (~80%–100%)**: Extends into graph theory and the new chapter on voting theory, with exercises and full solutions for practice problems closing out the text. 【Key Takeaways】 - **Proof is the through-line, not an afterthought** (Early): Induction, counterexamples, and direct proof are introduced early and reused throughout, so readers absorb rigorous argument as a habit rather than a separate topic. - **Two's complement makes binary arithmetic concrete** (Early): The book shows exactly how computers represent negative numbers and detect overflow, turning abstract number theory into something you can trace on paper. - **Logic and sets share a common structure** (Early): Truth tables, Boolean algebra, and set operations are developed in parallel, revealing the same laws (commutativity, distributivity, absorption) operating across domains. - **Boolean algebra leads directly to circuits** (Early–Middle): Karnaugh maps and normal forms are not just exercises—they connect to the design of digital adders and processors, giving the algebra a physical payoff. - **Relations generalize functions** (Middle): By treating functions as special relations, the book clarifies inverses, equivalence classes, and the one-to-one/onto conditions that matter for later work. - **Counting rests on independence** (Middle): The multiplication principle is presented with the caveat that it only works when events are independent—a small point with large consequences for probability. - **Applications anchor the abstraction** (Late): Cryptography, graph theory, and voting theory show discrete mathematics as a working tool, not a museum piece. - **Practice problems come with full solutions** (throughout): The book's scaffolded examples-then-exercises structure makes it genuinely self-study-friendly, though the excerpts do not detail every chapter's exercise set. 【Reading Tips】 - **Work the practice exercises as you go**: Full solutions are provided, so resist the urge to read them first—attempt each problem, then check. This is where the learning happens. - **Deep-read the early chapters on logic, sets, and induction**: Later material (Boolean algebra, relations, counting) builds directly on this foundation; skimming here will cost you later. - **Skim the circuit-design section if you are a pure math student**, and skim the voting theory chapter if you are a CS student—both are self-contained special topics. - **Keep a notation sheet**: The book introduces sigma notation, set operations, and relation symbols early and uses them constantly; a quick reference helps. - **Treat the new voting theory chapter as a capstone application**—it rewards readers who have absorbed the proof techniques from earlier chapters. 【Coverage Limits】 The excerpts cover the opening through roughly the middle of the book in detail, with lighter sampling of the later chapters on graph theory, cryptography, and voting theory; specific exercise content and the full chapter structure of the second half are not fully represented here.
Page 8
s higher in parts of this chapter than in most of the book. The final chapter is about voting systems. This topic has not been included in very many discrete...
View in text
Excerpt 2
ther cards (the other 47 cases). p ∨ q will be true for all thirteen hearts and all five honors in clubs, diamonds or spades (28 cases in all) and false in t...
View in text
Excerpt 3
natural way, and obviously no set can have two complements. Similarly, the negation of a proposition is a unique proposi- tion. This uniqueness is actually a...
View in text
Excerpt 4
that f −1 is a function from T to S. Then for every t ∈ T , exactly one ordered pair (t, s) ∈ f −1 and hence exactly one ordered pair (s, t) ∈ f . Since at l...
View in text
Excerpt 5
re there of seating six people at a round table so that two specific people sit together? 18. Five stereo systems are to be arranged in a line against the wa...
View in text
Excerpt 6
a bay filly, two are brown colts, and two are brown fillies. The color and sex of the first and second finishers are recorded. (i) Draw a tree diagram for th...
View in text
Excerpt 7
ents are left-handed. A student is chosen at random. If the student is left-handed, what is the probability that the student is male? 16. A school tax propos...
View in text
Excerpt 8
here is not one already, find all Hamiltonian cycles in the new graph, and delete any that do not contain the edge yz. The Hamiltonian cycles in the original...
View in text
Tags
AI categories
MathematicsComputer ScienceEducation
ISBN: 0817682856
Publisher: Birkhäuser
Publish Year: 2011
Language: English
Pages: 427
File Format: PDF
File Size: 3.6 MB
Text Preview (First 20 pages)
Registered users can read the full content for free

Register as a Gaohf Library member to read the complete e-book online for free and enjoy a better reading experience.

Generating text preview…