The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.
Welcome to Math 344!
|
Edits to the Math 344 web sites no longer count for the purpose of good deed points.
|
#
|
Week of...
|
Notes and Links
|
1
|
Sep 14
|
About This Class, Day One Handout, Tuesday, Hour 3 Handout, Thursday, Tutorial 1 Handout
|
2
|
Sep 21
|
Tuesday, Tutorial 2 Page 1, Tutorial 2 Page 2, Thursday, HW1
|
3
|
Sep 28
|
Tuesday, Class Photo, Tutorial 3 Page 1, Tutorial 3 Page 2, Thursday, HW2
|
4
|
Oct 5
|
Tuesday, Drawing -cubes, Thursday, HW3
|
5
|
Oct 12
|
Tuesday, Tutorial Handout, Thursday, HW4
|
6
|
Oct 19
|
Tuesday, Tutorial Handout, Thursday
|
7
|
Oct 26
|
Term Test on Tuesday, Dijkstra Handout,Thursday,HW5
|
8
|
Nov 2
|
Tuesday, Tutorial Handout, Thursday, HW6, Sunday November 8 is the last day to drop this class
|
9
|
Nov 9
|
Monday-Tuesday is UofT Fall Break, Thursday, HW7
|
10
|
Nov 16
|
Tuesday, Thursday, HW8
|
11
|
Nov 23
|
Tuesday, Thursday, HW9
|
12
|
Nov 30
|
Tuesday, Thursday, HW10
|
13
|
Dec 7
|
Tuesday, FibonacciFormula.pdf, semester ends on Wednesday - no class Thursday
|
F
|
Dec 11-22
|
The Final Exam
|
Register of Good Deeds
|
Add your name / see who's in!
|
|
|
This assignment is due at the tutorials on Thursday November 26. Here and everywhere, neatness counts!! You may be brilliant and you may mean just the right things, but if the teaching assistants will be having hard time deciphering your work they will give up and assume it is wrong.
Reread sections 5.1-5.5 of our textbook. Remember that reading math isn't like reading a novel! If you read a novel and miss a few details most likely you'll still understand the novel. But if you miss a few details in a math text, often you'll miss everything that follows. So reading math takes reading and rereading and rerereading and a lot of thought about what you've read. Also, preread sections 6.1-6.3, just to get a feel for the future.
Solve and submit problems 7, 9a, 11, and 15 in section 5.5. (9b was originally also assigned, but it is too difficult).
|
Dror's notes above / Students' notes below
|
|
Homework Assignment 8 Solution
9a) Show by combinatorial argument that
A)Split into two groups of n. Then choosing 2 out of can be seen as either choosing 2 from group 1 only
, which is or 2 from group 2 only, which is also , or one from each group, which is
. Their sum gives the total number of possibilities, which is exactly the right hand side of the equality.
Scanned Solution to Homework8 P7,11,15