Sums - Approximation Methods for Recurrences and Algorithms - Lecture 5
MIT OpenCourseWare via YouTube
Earn a Michigan Engineering AI Certificate — Stay Ahead of the AI Revolution
Google, IBM & Meta Certificates — 40% Off for a Limited Time
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore mathematical techniques for evaluating and approximating sums in this 82-minute lecture from MIT's Mathematics for Computer Science course. Learn how sums apply to recurrences, counting problems, probability calculations, algorithm runtime analysis, large system performance evaluation, and machine learning applications. Master three key approximation methods: perturbation techniques, the ansatz method, and the integral method for handling complex summations. Gain essential mathematical tools that form the foundation for advanced computer science concepts and practical problem-solving across multiple domains.
Syllabus
Lecture 5: Sums
Taught by
MIT OpenCourseWare