Tom Leighton
Professor of Applied Mathematics · MIT · Distinguished
Tom Leighton is Professor of Applied Mathematics at MIT and co-founder and CEO of Akamai Technologies, with research in algorithms and network design.
- lectures
- 20
- series
- 1
- hours
- 27
Start here
Series and courses
MIT 6.042J: Mathematics for Computer Science
Open the course
Show 16 moreShow fewer
- 5Number Theory II
- 6Graph Theory and Coloring
- 7Matching Problems
- 8Graph Theory II: Minimum Spanning Trees
- 12Sums
- 13Sums and Asymptotics
- 14Divide and Conquer Recurrences
- 15Linear Recurrences
- 18Probability Introduction
- 19Conditional Probability
- 20Independence
- 21Random Variables
- 22Expectation I
- 23Expectation II
- 24Large Deviations
- 25Random Walks
In these lectures
- A mathematical proof is a verification of a proposition by a chain of logical deductions from a set of axioms.Introduction and Proofs
- Assume the negation of a proposition and derive a falsehood to execute a proof by contradiction.Mathematical Induction
- Good proofs must be correct, complete, clear, brief, elegant, well-organized, and in order.Strong Induction
Draws on
People cited in the lectures, at the moment of the citation.
- Mark TwainQuoted regarding the three kinds of lies.
- Roger ClemensCited regarding a perjury case involving lies about steroids to Congress.
- Rod BlagojevichIllinois governor cited regarding his conviction.
- Noam ElkiesDisproved Euler's conjecture 218 years later.
- Christian GoldbachConjectured Goldbach's conjecture in 1742.
- Bernhard RiemannWrote an 1859 paper introducing the Riemann hypothesis.
About
Tom Leighton is Professor of Applied Mathematics at MIT and co-founder and CEO of Akamai Technologies, with research in algorithms and network design. His MIT 6.042J lectures teach undergraduate discrete mathematics, from induction and the 8-puzzle invariant to the Gale-Shapley algorithm and the Monty Hall problem.
Taught with
Same subject, Algorithms & Theoretical CS
Connections
24Their places, courses, books and lectures.


