Lecture 9 (14 February)

We discussed some issues from the quiz, most notably:

• defining a function via several cases for different types of inputs

We also did exercises on

• Building a function from A onto B, where A and B are infinite sets and B seems like a "larger" set.
• A short trailer for the RSA cryptography algorithm. See the Rosen or Liebeck texts (on reserve in the library) for details.

Announcements

• Midterm coming up a week from Thursday (23rd) in class.
• Study materials for exam should be posted soon (later today?)
• Exam review session likely Sunday afternoon: watch Piazza for details.
• Reminder to book a room with DRES if you need extra time etc for the upcoming midterm.
• On homeworks (and eventually the midterm exam), write the DAY and TIME of your discussion section. We need this to sort items effectively for grading. Don't write the registrar section ID (e.g. ADF), don't write your lecture section, and especially don't omit this information.
• The first honors assignment has been posted on the Honors web page, due Tuesday the 21st.