Lecture 6 (2 February)

We discussed some issues from the quiz, most notably:

• Checking a claim by trying small integer values.
• Remainder is always positive in math (beware of some programming languages).
• In modular arithmetic, each equivalence class has many names.

We also did exercises on

• Modular arithmetic computations
• Writing a proof about congruence mod k (only 11am lecture)
• Speed of the GCD algorithm (more detail in the 12:30 lecture)

Tip for making Piazza's thread/indexing system work more smoothingly: rather than posting a "followup" to a discussion, consider

• Replying to the previous comment, so that your text ends up at the end of the same (sub)thread, or
• If it's on a new topic, write a new question/note.

Announcements

• Question 4 of today's quiz will be worth 0 points in the scores due to worries about whether people did/didn't see the correction in time.
• Quizzes in general: we're working on how hard to make them. Keep giving us feedback. Don't stress about the raw numbers since we can always curve if the numbers run low. Keep your attention on what's most important: understanding the material.
• First honors assignment will be coming out soon and will involve simple use of Latex.
• Getting started with Latex workshop, open to all and aimed at absolute beginners, next Monday, 7pm, 0220 Siebel.