Mon

Tues

Weds

Fri

Jan 23 Section 1.1
Video help
HW: 1.1 # 1, 5, 7, 9, 11, 15 due Wednesday

Section 1.2: Matching problems.
Try to find solutions to matching problems and describe your process Write down the algorithm--the steps you follow to do what you do. Handout.

Permutations
Homework:
1.2 # 7 (Show how to write out with factors), 11, 17, 21, 25, 27, 30-32

1.3 Subsets
Homework:
1.3 # 1-7, 21, 23, 24, 25

Jan 30 More with sets
Probable homework:
2.1 # 1-7 odd, 9-12

Still more with sets:
No new homework

More sets.
Homework handout
Notes from class

Algorithms
Homework:
1.4 # Homework: 27-30
Handout (copies of algorithms from sec 1.4)
Video examples: Horner, Prob 27

Feb 6 More with algorithms
Handout.
No homework due, but redo 1.1 # 15 using the PERT Algorithm, and do one of the matching examples using A and B

Some review topics

Equivalence Relations
2.2 # 1-11 odd, due Monday

Feb 13
2.2 # 14, 15, 16, 18
Notes

More 2.2 notes 
Hints

3.1 # 1-15 odd
Some notes and more notes

3.1 # 17-35 odd

Feb 20 Homework is 7 problems.  See last page of these notes.
Mod multiplication tables.

Homework sheet. Probs 1-7 due Weds.  Probs assigned 2/21 due Friday.
Vids for proving equivalence relations: reflexive, symmetric. transitive. Paper example

2.5 # 11, 12, 13, 15 due Friday.Video example:
Step 1 (check the first case(s))
Step 2 (induction hypothesis and substitution)
Step 3 version 1 (showing case k+1 using algebra and factoring)
Step 3 version 2 (showing case k+1 without factoring)
Written version

2.6 # 5-25 odd

Feb 27 Homework due Friday
2.6 # 13, 17, 19, 21, 25
8.3 # 13-16
Notes

More counting strategies
HW 8.2 # 2, 3, 5, 7, 13, 15

Quiz on equivalence relations and mod numbers 

8.2 # 18, 20, 21, 23, 24, 26, 27, 29, 30
8.3 # 17, 18, 21, 22, 24, 25, 26, 29 (due Monday)

March 6
8.4 # 1-21 odd

8.5 # 1-30 odd
Practice induction problem.

Some practice problems (handed out in class) and solutions. Also  make sure you understand the problems we did today (eg. the Sassafras and tomato problems). Here are my notes from today.

Test on induction and Counting techniques

March 13

Spring

Break

March 20 Sets and logical statements
Homework:
handout 
Notes

More with truth tables
Probable homework:
A.2 #  1-9 odd (Due Weds)

Some proof with logical statements
Homework:
A.2 # 11, 15, 17, 23, 26c, 27 (e), 28 (h), 29 (i), 30, 31, 32,
100. Show the following are logically equivalent :
(p → q) and (~(p ^ ~ q))

March 27 Review of  proofs from Friday    

Start chapter 9: recursive relationships
HW: 9.1 # 1-17 odd

Induction and recursive vs. explicit formulas
HW: 9.2 # 1, 2 
Example from class

Class cancelled

April  3 

Homework from this week:
9.2 # 4, 11, 13, 17
9.3 # 1-9 odd, 25, 27
9.1 # 21, 27
Logic and proof review WS

April 10

HW 4.1 # 1, 2, 5, 6, 9-12, 15, 18, 19, 28, 29, 31, 35-37

HW 4.1 # 21-25

HW 4.1 # 42-43 and
Chapter 9 practice problems

April 17 worksheet.
Logic and proof review solutions
Chapter 9 practice solutions

Test: logical statements, proof and recursion

April 24
HW 4.2: For the graphs in 18-23, decide if it has an Euler circuit, path or neither.  Show the path or circuit or explain why none exists.

 4.3 # 2, 3, 4, 7, 8, 9, 10, 12 

4.4 # 1-8, 15-17, 23, 26

May 1
5.1 # 1-8 (if it is not a tree, tell why not), 9, 10, 14-16
5.2 # 1-6

5.2 # 17-20, 29
5.3 # 1-6

4.5

Review Sheet 

May 8