Now showing items 1-2 of 2
18.314 Combinatorial Analysis, Fall 2005
This course analyzes combinatorial problems and methods for their solution. Prior experience with abstraction and proofs is helpful. Topics include: Enumeration, generating functions, recurrence relations, construction of ...
6.042J / 18.062J Mathematics for Computer Science, Spring 2005
This course is offered to undergraduates and is an elementary discrete mathematics course oriented towards applications in computer science and engineering. Topics covered include: formal logic notation, induction, sets ...