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

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

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