MATH 3533 — Combinatorial Mathematics

4 semester hoursUndergraduateLectureusually offered: springtypical days: M/WBostonTraditional

Introduces techniques of mathematical proofs including mathematical induction. Explores various techniques for counting such as permutation and combinations, inclusion-exclusion principle, recurrence relations, generating functions, Polya enumeration, and the mathematical formulations necessary for these techniques including elementary group theory and equivalence relations.

Prerequisites

Offering history

TermSectionsEnrolledCapacityFullOpen seats/section
Spring 20241121867%6.0
Summer A 2024193526%26.0
Spring 202511818100%0.0
Summer A 20251193554%16.0
Spring 20261122548%13.0

Snapshots from scheduled scrapes — not live seat availability. "Full" can exceed 100% when sections over-enroll.

Meeting times

Share of recent sections by weekday: M 57% · T 44% · W 70% · Th 44% · F 0%

Common patterns: MTWR (27% of sections), W (26% of sections), T (17% of sections), MWR (17% of sections), M (13% of sections) — in patterns, R means Thursday

Professors

Spring

Summer A

Percentages are each professor's average share of the season's enrolled students in recent terms.

Unlocks

MATH 3545

Courses that list MATH 3533 in their prerequisites.

Links

Official catalog (MATH course descriptions) · Student reviews on RateMyHusky · All MATH courses · Plan it at numap.app