K. N. Boyadzhiev, Apostol-Bernoulli functions, derivative polynomials, and Eulerian polynomials, Advances and Applications in Discrete Mathematics 1 (2008) 109–122 ...

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

Introduces students to ideas and techniques from discrete mathematics that are widely used in science and engineering. Mathematical definitions and proofs are emphasized. Topics include formal logic ...

1 Apply the basic principles of mathematical logic. 2 Construct and analyse mathematical proofs. 3 Apply the principles of set theory, functions and relations. 4 Apply the principles of abstract ...

Partition functions, which enumerate the distinct ways a positive integer may be expressed as a sum of positive integers, have long captivated mathematicians due to their deep connections with number ...