Math 210 Class Notes

Last update: 12/9/15

LINKS (to several web-based activities and other optional reading material)

* Links with an asterisk are from Doug Ensley's Discrete Math Resources web page at Shippensburg University

Section of textbook Corresponding links
1.0 Set notation*- practice with set-builder notation
Set operations* - input two sets, shows union and intersection
1.1 Venn Diagrams* - find the region of a 3-set Venn diagram corresponding to a given set
Element chasing* - "fill in the blank" practice for element chasing proofs.
(These are subset proofs, not set equality proofs - note the difference.)
1.2 Proofs using set identities* - "scrambled proofs," using set identity laws to prove ne set identities
Note terminology differences between our text and this web page:
  • Our book's "weak absorption" laws are called "universal bound" laws on this page
  • Our book's "complementarity" laws are called "negation" laws on this page
  • Our book's "involution" law is called "double negation" on this page
5.1 Truth Tables: Syllogisms:
5.2 Boolean algebra* properties - "scrambled proofs" (similar to the Section 1.2 link below)
Boolean algebra truth tables* (Note: in these applets, the notation x' is used for "inversion")
1.3 Two-set arrow diagrams for functions*
Two-set arrow diagrams for relations*
Function composition*
Proofs about injective and surjective functions*
1.4 - 1.5 One-set arrow diagrams for relations *
Proofs about properties of relations on a set *
Counterexamples *
2.0 Geometric Proof of the Irrationality of Square Roots (from cut-the-knot.org)

Find counterexamples * - Find more counterexamples *
"Fill in the blank" proofs *
"Proof Reader" * - practice proofreading proofs and looking for possible errors
More "Proof Reader" * proofreading exercises
Scrambled Proofs * - More Scrambled Proofs *
Chapter 4 Seven Bridges of Konigsberg (Wikipedia)

Euler cycles & paths *
Hamiltonian cycles *
(vocabulary note: in the applets, "trail" = "path," and "circuit" = "cycle")