Hypha

hypha

Lecture 5: Sums

1:22:20 Free

Sums are useful for recurrences, counting, probability, runtimes of algorithms, performances of large systems, machine learning, and much more! This lecture looks at ways to approximate sums through perturbation, ansatz method, and the integral method.

Source: Brynmor Chapman, Mathematics for Computer Science (MIT: OpenCourseWare). Licensed under CC BY-NC-SA 4.0.

Hypha Official

Watch what matters. Create what pays.

MIT 6.1200J: Mathematics for Computer Science

This course covers elementary discrete mathematics for science and engineering, with a focus on mathematical tools and proof techniques useful in computer science. Topics include logical notation, sets, relations, elementary graph theory, state machines and invariants, induction and proofs by contradiction, recurrences, asymptotic notation, elementary analysis of algorithms, elementary number theory and cryptography, permutations and combinations, counting tools, and discrete probability.