{"id":952,"date":"2023-01-18T17:49:22","date_gmt":"2023-01-18T17:49:22","guid":{"rendered":"https:\/\/math.hmc.edu\/su\/?page_id=952"},"modified":"2026-04-06T22:11:58","modified_gmt":"2026-04-06T22:11:58","slug":"math55","status":"publish","type":"page","link":"https:\/\/math.hmc.edu\/su\/math55\/","title":{"rendered":"Math 55: Discrete Math – Spring 2026"},"content":{"rendered":"
\n
\"\"<\/figure>\n<\/div>\n\n\n

Professor Francis Su<\/strong>
Section 1, Spring 2026<\/p>\n\n\n\n

Meetings:<\/strong> MW 1:15pm – 2:30pm<\/p>\n\n\n\n

Course Webpage<\/strong>: https:\/\/math.hmc.edu\/su\/math55\/<\/a><\/p>\n\n\n\n

My Email:<\/strong> (my last name) at math.hmc.edu<\/p>\n\n\n\n

Graders: <\/strong>Joshua Zhong, Aidan Deshong, Lily Surjadinata can be reached at g.hmc.edu<\/p>\n\n\n\n

Office Hours<\/strong>: Mondays 3:30 – 5:00pm at my office (Shan 3416) or by appointment.
<\/p>\n\n\n\n

Course Description<\/h2>\n\n\n\n

This course is an introduction to combinatorics, number theory, and graph theory with an emphasis on creative problem solving and learning to read and write rigorous proofs. Topics include: combinations, permutations, inclusion-exclusion, strong induction, recurrences, the Euclidean algorithm, unique factorization, modular arithmetic, Euler’s theorem, RSA encryption, planar and Eulerian graphs, and graph coloring. My goal is to create an inclusive classroom climate where everyone feels responsible for the participation and the joy that others experience in learning.<\/p>\n\n\n\n

Text<\/h2>\n\n\n\n

There is no required textbook to buy. <\/p>\n\n\n\n

We will use portions of Oscar Levin’s Discrete Mathematics: An Open Introduction<\/a><\/em> (4th edition), which is available as an interactive online ebook<\/a>. (There is a PDF<\/a> available as well, but BEWARE: the homework problems sometimes differ, so be sure to use the online text for homework<\/em>).<\/p>\n\n\n\n

Coursework<\/h2>\n\n\n\n

There are weekly homeworks, one midterm and one final exam. Each component (homework, midterm, final) is worth at least 30% of your final grade, with the “best” component worth 40%. A component of the midterm will be in-class. Final exam will be in class.<\/p>\n\n\n\n

Every assignment (except the last one) has an automatic 24 hour extension–you do not need to formally request this extension.<\/p>\n\n\n\n

The learning you are doing in this class takes place in a larger framework of school and life. Sometimes life takes precedence. Similarly, ‘success’ by whatever measure is not the most important thing in this course either. Every assessment of your work in this class is a measure of mathematical progress, not a measure of your mathematical promise. Joy, wonder, and expanding your mind through struggle—these are more important!<\/p>\n\n\n\n

Tutoring<\/h2>\n\n\n\n

Academic Excellence Tutors are available Mon, Tue, Fri evenings at these times and locations<\/a>.<\/p>\n\n\n\n

Honor Code<\/h2>\n\n\n\n

The HMC Honor Code applies in all matters of conduct concerning this course. Though cooperation on homework assignments is encouraged, you are expected to write up all your solutions individually to ensure your own understanding. Your solutions should acknowledge the assistance of other people or resources of any kind.<\/p>\n\n\n\n

AI Policy<\/h2>\n\n\n\n

(1) Online resources, including artificial intelligence, may be consulted for supplemental<\/em> learning<\/strong> that is not directly related to assigned problems (e.g., questions about a general topic). However:<\/p>\n\n\n\n