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

MATH.2195 — Undergraduate Id: 042279 Offering: 1 Credits: 3-3 Description Discrete Mathematics plays an important role in explaining key concepts in Information Technology and Computer Science, This ...

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, ...

Covers topics in discrete mathematics with applications within computer science. Some of the topics to be covered include graphs and matrices; principles of logic and induction; number theory; ...

SIAM Journal on Applied Mathematics, Vol. 34, No. 4 (Jun., 1978), pp. 687-691 (5 pages) In this paper, bifurcations of the recurrence relation X n + 1 = F(X n) are studied. For a certain class of ...

In this study, depending on the upper and the lower indices of the hyperharmonic number h n ( r ) , nonlinear recurrence relations are obtained. It is shown that generalized harmonic numbers and ...

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 ...