Welcome!
Here you will see info about what we did in class, upcoming exams, solutions for past exams, etc.,
CHECK AT LEAST ONCE A WEEK!!
NOTES, TESTS AND HOMEWORKS FROM PROOFS I

COURSE PAGE WITH SYLLABUS, GRADING SCHEME ETC

NOTES, TESTS AND HOMEWORKS FROM Spring 2019 PROOFS II

Started 1/10/2020





Room change: From now on we will meet in Annex 3, 210 (Graduate school bldg).
Enter from 4th and College, go to the right and then go up.

QUIZ I ON WEDNESDAY, JAN 29. PROOF BY INDUCTION AND CYCLES IN GRAPHS.

Monday, 1/27/2020
Today we reviewed strong induction and worked out some exercises.
Please read the Updated Notes on strong induction from today (Refresh browser)
and try the exercises 3 to 6.


Wednesday, 1/22/2020
Today we reviewed basic induction and started with strong induction.
Please read the Updated notes on induction from today (REFRESH BROWSER).
Also please read the Notes on strong induction from today
and try the problems on the last page.


Friday, 1/17,2020
Room change: From now on we will meet in Annex 3, 210 (Graduate school bldg).
Enter from 4th and College, go to the right and then go up.


Wednesday, 1/13/2020
Today we discussed Eulerian graph and Hamiltonian cycles, and necessary and sufficient conditions for a graph to be Eulerian or Hamiltonian.
Please read the Updated notes from today (REFRESH BROWSER) and try the problems on pages 12 and 14.


Monday, 1/13/2020
Today we discussed the Knight's tour problem, Koenigsburg bridge problem, Eulerian graph and Hamiltonian cycles.
Note that Hamiltonian cycles visit each vertex once while Eulerian cycles visit each edge once. Eulerian cycles can pass vertices more than once.

We also reviewed the different kinds of proofs and the Binomial formula.
Please read the notes from today and try the problems on pages 10, 12 and 14.
Also try to come up with a graph which has no Eulerian paths.
(So it must have 1 odd vertex or 3 or more odd vertices).


Friday, 1/10/2020
On Monday we will start with a review of induction and quickly move on to strong induction.
We will use the binomial formula as a source for examples.
Please review these notes from Spring 2019 before coming to class.