Back to library

John Hammond

Discrete Math for Shockers

A bridge into discrete mathematics: sets and symbols, symbolic logic and proof techniques, classic number theory, sequences, recurrence and induction, and counting. The exercises train the transition skill this course exists for — turning an intuition into a precise, correct proof.

Discrete Math for Shockers

133 exercises21 sections

Status

Sections

FlagsLoading your progress…

Basic Objects and Symbols

29

Propositional Logic6

Relations and Functions13

Symbolic Logic and Proofs

37

Logical Equivalences6

Application: Set Equivalences5

Propositional Functions and Quantifiers6

Logical Arguments5

An introduction to proofs7

Chapter Review8

Some Classic Number Theory

20

Divisibility and Congruences4

GCDs and The Euclidean Algorithm4

Multiplicative Inverses4

Modular exponentiation1

Application: Encryption3

Sequences, Recurrence, and Induction

26

Sequences and Series5

Solving Recurrence Relations8

Mathematical Induction13

Counting Techniques

21

The Multiplicative and Additive Principles8

Permutations and Combinations5

Combinatorial Proofs8

Adapted from Discrete Math for Shockers © 2021 John Hammond. Licensed under CC BY-SA 4.0. Source: Discrete Math for Shockers. Imported at revision 2538beb.