# Lec 7 | MIT 6.042J Mathematics for Computer Science, Fall 2010

Skip to content
# Lec 7 | MIT 6.042J Mathematics for Computer Science, Fall 2010

##
41 thoughts on “Lec 7 | MIT 6.042J Mathematics for Computer Science, Fall 2010”

### Leave a Reply

Career In Forensic Science

Thanks 🙂

thanks! Do you have this lection as text?

lovely lecture…

I dont really understand the last prove I feel like he contradicted himself by saying that the girl also gets the best choice in TMA.

In the last proof , his assumption was that there exist a worser matching for G, in which the girl G has a boy B' married to him and B' is worser than G's match in TMA .but by Thm 4 , the boy B who is married to G in TMA has his favorite match in TMA , but in this matching B doesnt like his mate (compared to TMA) .thus B , G form a rogue couple .

So no such stable matching in which G has worser mate exist

O ok thank you

awesome choice of sociological parallel. very clever and applicable indeed.

In the last proof, Do we need to consider the other case in which some girls have a better choice than the pessimal partner?

He really looks like tim cook in some shots.

01:02:28 Student on the left is NOT buying that

Poor Mergatoid. =(

I know i'm late to the party but at the end, when he proves Thm 3, he uses 2 cases to base his proof upon. In this particular example, it is kind of obvious that there is no other possible cases but imagine a different example where this is not the case. Don't I have to somehow ALSO prove that there is no other possible cases? And so, no matter how trivial, don't I still have to prove it in this example too?

In the video, at 48:19, Thm1 says TMA terminates in <= n^2 + 1 days. Why not n^2 days? In the course note on page 139, TMA terminates in <= n^2 days.

Just Amazing

this teacher is really awesome.

THM 1: Each boy has N girls on his list. So if the algorithm terminates in n^2 + 1 days doesn't that mean that each boy made N cross outs. In other words didn't each boy get denied by each girl and thus have no more options left? Wouldn't the maximum number of steps therefor be (n-1)^2 +1

he's a complete teacher

How does we insure that the solution came out of TMA is most fair among all the stable matching possible out of preference list. and how we calculate realm of possibility for each man and woman.

Fast forward to 2016 >> Angelina don't seem to really like Brad .

I dont really understand the first part. How is (Brad-Ang and BB-Jen) not a rogue couple, but (Brad-Jen and BB-Ang) is?

I'm desperate for the recitation videos.

can anyone pls provide the proof of thm_4?

Is guy on min 4.15 on blue screen installing and old windows or what

{x1 – x6, x2 – x5} what a weird notation

Watching this video in 2017 and looking at the Brad Jennifer Billy Bob Angelina example, pretty ironic.

I like how the views go down exponentially later into the semester.

I wish I could give more than one like for lectures from this professor.

The girl in front is using steno machine!

lol "doing their 6.042 hw together at night"

can anyone pls tell me what TMA stands for?

I don’t see how proof of theorem 5 proves that girls always get the pessimal mate. Can someone clarify? Thanks. This lecturer is awesome

At 24:55 he says "tomorrow at recitation…" does he mean the lecture by Dr. Marten van Dijk, because he just seems to like recite from his notes ?

Cool

@15:55 Sadly Brad and Angelina weren't happy with each other …

Amazing work!!

У нас проходят тоже самое за пол пары, что в мит за 7 лекций)

Poor brad 🙁

It feels orgasmic to get an MIT lecture free of cost. The world is a good place now.

Mergatoyd not Mergatoid 😉 — Heavens to Mergatoyd

Lovely lecture, such simplicity, and also poor little mergatoid :'(

made my day..