Class 10:
In(tro)duction
cs2102: Discrete Mathematics | F16
uvacs2102.github.io
David Evans | University of Virginia
Slide 2
Slide 2 text
Plan
Finish Power Sets Proof
by Well-Ordering Principle
Induction Principle
Induction Examples
Slide 3
Slide 3 text
My Grading Scale
«Gold Star – Excellent Work – got everything I
wanted out of this
«Green Star – Got most things I wanted, but
some answers could be better
«Silver Star – Some serious problems
Slide 4
Slide 4 text
Unbounded Expectations!
«« - exceptional work
«««- better than I thought possible
««««- breakthrough!
«««««- deserve a Turing Award!
Slide 5
Slide 5 text
No content
Slide 6
Slide 6 text
Grades do not have denominators!
Scores are not “out of” anything.
Point of the assignments is for learning, not for taking of points.
Slide 7
Slide 7 text
Well-Ordering Proofs
What can we conclude at the end of a well-ordering principle proof?
Slide 8
Slide 8 text
Power Set Size
To use well-ordering (or induction!) need a proposition like:
∀ ∈ ℕ.
Goal: ∀ ∈ . = 2|3|