Lecture Overview

Lecture 6 & 7: Introduction to Combinatorics.

Lecture 5: Finite Differences, Dynamic Programming, Countable infinity: proof that card(N)=card( Z)=card( Q), Uncountable infinity: diagonalization proof that card(R) > card(N).

Week 1 (Lectures 1-4): Introduction to class, Binary Search, Propositional Logic, Truth tables, Predicates, Proof techniques, Induction, Strong induction (Ch1, Ch4.1-4.2)


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s

%d bloggers like this: