This is a course covering a number of concepts and techniques of discrete mathematics. Topics covered: Counting: selections; inclusion-exclusion; generating functions; recurrence relations. Graph ...

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic and Boolean circuits; sets, ...

Description: The course covers mathematics useful in analyzing computer algorithms. Topics include recurrence relations, evaluation of sums, integer functions, elementary number theory, binomial ...

Taking derivative of our generating functions, we give partial differential equations and also functional equations. By using these equations, we derive recurrence relations and some formulas of our ...