LECTURES A GRATIS GLOBAL SERVICE
⌕ SEARCH GRATIS GLOBAL ↗
LECTURES
Lecture 5: Sums
SOURCE: YOUTUBE · NO TRACKING UNTIL YOU PRESS PLAY · TROUBLE PLAYING? WATCH AT THE SOURCE ↗

Lecture 5: Sums

82 MIN · EN · STATUS: [ STREAMING ]
RATE THIS
MIT · Mathematics for Computer Science · LECTURE 5

MIT's 6.1200J Mathematics for Computer Science, taught by Brynmor Chapman, devotes this lecture to approximating sums. Chapman works through three techniques: the perturbation method, which manipulates a sum algebraically to solve for itself, the ansatz method, where a guessed closed form is verified and refined, and the integral method, which bounds a sum by comparing it to an integral. The motivation throughout is practical, sums of this kind show up in recurrences, combinatorics, probability calculations, and the runtime analysis of algorithms. The 82-minute session is chalkboard-style instruction, working through example sums step by step and showing how each approximation technique handles different growth rates. It is part of MIT OpenCourseWare's Spring 2024 offering of 6.1200J, the discrete mathematics course for computer science majors.

At a glance

Lecture facts

Runtime compared with the other 507 Mathematics lectures
Runtime1 h 22 m
Compared with MathematicsLonger than 87%
This series

Mathematics for Computer Science

Every lecture in order, sized by its length.

  • Earlier lectures
  • This lecture
  • Still to come
Lecture 4 of 224 h before this · 29 h 3 m in total

More from this course

12 LECTURES
Predicates, Sets, and Proofs

Predicates, Sets, and Proofs

MIT · 79 MIN
Contradiction and Induction

Contradiction and Induction

MIT · 80 MIN
State Machines

State Machines

MIT · 81 MIN
Lecture 6: Asymptotics

Lecture 6: Asymptotics

MIT · 78 MIN
Divisibility

Divisibility

MIT · 79 MIN
Modular Arithmetic

Modular Arithmetic

MIT · 80 MIN
Lecture 10: Cryptography

Lecture 10: Cryptography

MIT · 81 MIN
Graphs and Coloring

Graphs and Coloring

MIT · 81 MIN
Lecture 12: Matching

Lecture 12: Matching

MIT · 82 MIN
Lecture 13: Connectivity and Trees

Lecture 13: Connectivity and Trees

MIT · 82 MIN
Digraphs and DAGs

Digraphs and DAGs

MIT · 79 MIN
Relations and Counting

Relations and Counting

MIT · 79 MIN