This page will be updated at least once a week. Please check it regularly
for announcements.
| Announcement: There will be a review session on Sunday, December 17, 1-3:30pm in the Math Tower, P-131. Here is the list of topics that will be covered on the final exam. |
|
Classes:
MWF 9:35-10:30AM Humanities 1003
Instructor: Valentina Kiritchenko office: Math 3-102 phone: 632-8884 e-mail: vkiritch at math dot sunysb dot edu Office Hours: M 4-5 pm, W 4-6 pm at Math 3-102 and M 5-6 at MLC |
|
About this Course: There is much more to mathematics than just calculations and solving equations. In this course we will examine several mathematical topics accessible to students with an understanding of high-school mathematics. These will be selected from among the following: probability; logic; graphs, paths and networks; tilings and polyhedra; game theory; number theory.
| Problems |
Topics and Sections |
| 1 |
Probability theory: elementary and conditional probability, 4.1, 4.4 |
| 2 |
Probability theory: expected value, 4.7 |
| 3 |
Probability theory: counting techniques, 4.5 |
| 4 |
Paths and networks: Euler paths, 6.1 |
| 5 |
Tilings and polyhedra: polyhedra and Euler formula, 7.3 |
| 6 |
Number theory: modular arithmetic, 8.2 |
| 7 |
Number theory: divisibility tests, 8.3 |
| 8 |
Number theory: affine ciphers, 8.6 |
| Weeks |
Sections |
| Sept. 6-8 |
4.1 |
| Sept. 11-15 |
4.5 |
| Sept. 18-22 |
4.6, 4.3 |
| Sept. 25-29 |
4.4 |
| Oct 2-6 |
4.7, 4.8 |
| Oct 9-13 |
6.1 |
| Oct 16 |
1st Midterm (covers 4.1, 4.3-4.8) |
| Oct 23-27 |
6.2 |
| Oct 30-Nov 3 |
7.1, 7.2 |
| Nov 6-8 |
7.3 |
| Nov 10 |
2d Midterm (covers 6.1, 6.2, 7.1, 7.2 ) |
| Nov 13-17 |
8.1, 8.2 |
| Nov 20-22 |
8.3, 8.4 |
| Nov 27-Dec 1 |
8.5, 8.6 |
| Dec 4-8 |
8.7, 9.1 |
| Dec 11-15 |
9.2, 9.3 |
September 6-8
Read Section 4.1. Do some experiments with coin tossing to see
what proportion of heads you get in the long run. You can use either a real coin or
the following
applet.
Quiz
September 11-15
Read Section 4.5. Review Section 4.1. If you submit a correct solution to
the September
problem of the month on or before October 1, you will get 5% of the course grade (even if you do
not win a prize)!
Homework 1
(due Friday, September 22): exercises 6, 8,
20, 28 from Section 4.1
and exercises 4, 6, 12, 16 from Section 4.5.
September 18-22
Read Sections 4.6 and 4.3. Read also the first part of Section 4.4
(about conditional probability). Review Section 4.5.
Homework 2
(due Friday, September 29): exercises 26, 30,
34, 36 from Section 4.5
and exercises 6, 20, 28, 32 from Section 4.6
September 25-29
Read Sections 4.4 and 4.7. Review Section 4.3.
Homework 3
(due Friday, October 6): exercises 2, 6,
16 from Section 4.3
and exercises 12, 14, 34, 38, 40 from Section 4.4
October 2-6
Read Section 4.8. Review Section 4.7. See the
solution to September problem of the month.
Homework 4
(due Friday, October 13): exercises 2, 8,
18, 22 from Section 4.7
and exercises 4, 6, 22, 28 from Section 4.8
October 9-13
Read Section 6.1. Review Sections 4.1, 4.3-4.8 and prepare for the midterm.
Homework 5
(due Friday, October 20): exercises 4, 12, 14,
16, 20, 22 from Section 6.1
and exercises 2, 4 from Section 6.2
October 16
Midterm
October 18-20
Read Section 6.2 (nearest neighbor algorithm). Review Section 6.1.
Homework 6
(due Friday, October 27): exercises 8, 16,
18, 20, 26, 30, 32, 34 from Section 6.2
October 23-27
Read Section 6.2 (greedy algorithm). Review nearest neighbor algorithm.
Homework 7
(due Friday, November 3): exercises 4, 12,
20, 24, 30 from Section 7.1 and exercises 2, 6, 10
from Section 7.2
October 30-November 3
Read Sections 7.1 and 7.2.
No homework for the next week. Prepare for the midterm.
November 6-8
Read Section 7.3. Review Sections 6.1, 6.2, 7.1 and 7.2. Prepare for the midterm.
Homework 8
(due Friday, November 17): exercises 20, 22,
24, 30 from Section 7.2 and exercises 8, 14, 20, 30
from Section 7.3
November 10
Midterm 2
November 15-17
Read Sections 8.1-8.3.
Homework 9
(due Monday, November 27): exercises 22, 32
from Section 8.1, exercises 30, 32, 34
from Section 8.2 and exercises 4, 18, 26 from Section 8.3
November 20-22
Read Sections 8.3-8.4. Review Sections 8.1-8.2
Homework 10
(due Wednesday, December 6):
exercises 10, 20, 27, 30
from Section 8.3 and exercises 6, 10, 22, 24 from Section 8.4
Project 1: Do Project 1 from Chapter 6 (p. 415). Give an example when your algorithm produces a better solution than the nearest neighbor and greedy algorithms do.
Project 2: Do Project 4 from Chapter 6 (p. 416).
Project 3: Do Project 2 from Chapter 7 (p. 460).