Maths 366, Discrete Mathematics

Alexander Hulpke

On Friday, May 19th office hours will be only by appointment.

This page contains material for my Math 366 course, Spring 2000.

Midterm 2
Sample solution

Office Hours

WF
11.00-12.00
MWF
14.00-15.00
and by appointment

Handouts
These are pdf files of my handouts. Let me know if you cannot read this format.

Welcome Sheet
Old Midterms and Final
A bad induction proof (and a better one)

Homework
Homework problems are for the days the respective section is done in the lecture. The dates are given are due dates.

Mar 30:
1.1:8bc, 18,31 32,44
Mar 30:
1.2:13b, 16/18/19 b,g each, 40
Apr 3:
1.3:2,12b,14,27-30,37bc
Apr 5:
1.4: 19,23,27,31
Apr 7:
5.1: 3,6,9,14; 2.1: 2,3
Apr 10:
2.1: 7,11b,d,19,25,27,36,37
Apr 12:
2.2: 4,6,17,21,32,36
Apr 19:
3.1:18,20,24,28,30,32
Apr 21:
5.2:4,11,17,21
Apr 24:
5.2:18,19,33,39
Apr 26:
3.2: 7,24,32; 3.6:4
Apr 28:
3.6: 16,20,22
May 1:
4.1:23,27,36,40
May 3:
4.2:4,7,13
May 5:
4.3:7,20,23
May 8:
4.3:22,25; 4.4: 2
May 12:
4.4: 5
May 15:
5.3: 14,18,44,46
May 17:
Problem Sheet
May 19:
7.1: 9,29,31
May 22:
7.3: 5,15,28
May 24:
7.5: 3,12,16
May 26:
10.2: 13,25,32
May 31:
10.3: 3,16,17

Books
(extra reading if you want -- entirely voluntary) If you study computer science, you might find it iteresting to look at the material in the course from a point of view of algorithm design and you might want to browse through books such as:

D.E.Knuth: The Art of Computer Programming, Vol I
U. Manber: Introduction to Algorithms

Web Resources

MSLC Tutoring: CH 147e. Tu,Thu 2.30-4.30pm
Teaching resources provided by the math department and OSU.
The syllogism machine
On-line encyclopedia of integer sequences

Back
to my Homepage

27-Mar-2000

Alexander Hulpke (ahulpke@math.ohio-state.edu)

Midterm 2	Sample solution

Office Hours	WF 11.00-12.00 MWF 14.00-15.00 and by appointment

Handouts	These are pdf files of my handouts. Let me know if you cannot read this format. Welcome Sheet Old Midterms and Final A bad induction proof (and a better one)

Homework	Homework problems are for the days the respective section is done in the lecture. The dates are given are due dates. Mar 30: 1.1:8bc, 18,31 32,44 Mar 30: 1.2:13b, 16/18/19 b,g each, 40 Apr 3: 1.3:2,12b,14,27-30,37bc Apr 5: 1.4: 19,23,27,31 Apr 7: 5.1: 3,6,9,14; 2.1: 2,3 Apr 10: 2.1: 7,11b,d,19,25,27,36,37 Apr 12: 2.2: 4,6,17,21,32,36 Apr 19: 3.1:18,20,24,28,30,32 Apr 21: 5.2:4,11,17,21 Apr 24: 5.2:18,19,33,39 Apr 26: 3.2: 7,24,32; 3.6:4 Apr 28: 3.6: 16,20,22 May 1: 4.1:23,27,36,40 May 3: 4.2:4,7,13 May 5: 4.3:7,20,23 May 8: 4.3:22,25; 4.4: 2 May 12: 4.4: 5 May 15: 5.3: 14,18,44,46 May 17: Problem Sheet May 19: 7.1: 9,29,31 May 22: 7.3: 5,15,28 May 24: 7.5: 3,12,16 May 26: 10.2: 13,25,32 May 31: 10.3: 3,16,17

Books (extra reading if you want -- entirely voluntary)	If you study computer science, you might find it iteresting to look at the material in the course from a point of view of algorithm design and you might want to browse through books such as: D.E.Knuth: The Art of Computer Programming, Vol I U. Manber: Introduction to Algorithms

Web Resources	MSLC Tutoring: CH 147e. Tu,Thu 2.30-4.30pm Teaching resources provided by the math department and OSU. The syllogism machine On-line encyclopedia of integer sequences
Back	to my Homepage