Last time | Next time |
Let us continue our work in this class, in order to maintain some sense of the normal.
In particular, we've dropped the chapter 7 material. Something had to go, and we figured that you all are most familiar with that.
There has been no change in our exam schedule!
I'll be adjusting the weights on homework and exams correspondingly.
Our department chair suggests using Microsoft Lens (getting started) to scan your homework to pdfs.
My son just installed the app on his android phone, fired it up, scanned a letter, and sent it to me as a pdf in about two minutes. And he wasn't sweating. So I think that it's doable.
Some of you may actually have a scanner!
At any rate, I'll probably not have any trouble with this audience figuring out how you'll get me your homework. Please do your best to make scans legible, however!
Please, please: put MAT385 and assignment info in the subject line of your message -- I'll be routing all messages using the tag MAT385. It will really help.
Perhaps you remember the "four-color problem", about needing no more than four colors to differentiate between countries on an ordinary map. If we think of the countries as nodes, and adjacency as edges, then a map turns into a planar graph. So the question is, can that planar graph always be assigned colors so that no two adjacent nodes are labeled with the same color?