The problem in Good Will Hunting - Numberphile

Share this video on

What's Hot

What's New

Top Grossing

Top of the Chart

Recommend

TooJ Kool : He has an unsolved Rubic's cube. I don't trust him.

Chyrosran22 : This just looks like molecules to me xD . Ethane, acetaldehyde, isobutane...

londontrada : This is Brian Cox's secret ginger younger brother. Hidden from the people, maligned by the press. He lives in a basement in Northampton and Brian bullies him for his ideas, steals them and then passes the ideas off as his own. The question is, how can we think of ourselves as decent human beings when we allow this kind of thing to go on in our own country. Mad or genius? You decide.

chomage : It looks like drawing isomers of molecules.

brotherbandit : A chemist at heart, I immediately associate mathematical trees with structures of alkanes. is there any real connection?

antiprotons : OMG!   I wish I had him for my math teacher when I was young. I was totally at a loss until I found a book with calculus in it...    Calculus was what really got me into math (calculus is more fun than other math  :) Nice video!

xelarutra : Is there any way to turn off that marker sound?

henriok : When I went to university and got an assignment like this, it either assumed or expressed that you should both show the solutions and prove why there isn't any other solution. So, even if it takes less than 2 years to find 10 solutions, it might take a bit longer to prove that there isn't any more solutions. In this case, that might be easy as well, but I don't think you stressed this point that finding solutions that satisfies the problem doesn't really solve the complete problem.

holycow343 : this reminds me of organic chemistry

fredguy2 : dude must be laying pipe on the regular.

Michael Hart : that ended rather abrubtly

Green Geralt : That unsolved Rubik's cube pisses me off.

El Baron Samedi : I guess the difficulty is on prove that there are 10 forms for n=10 ¿?

The Hammie Matt : what about the Math in Interstellar?

hybby : Matt Damon = Math Damon?

Abraham Lincoln : *"Take care of business: You don´t have to worry about thinking enough to take care of business. The only problem you will have is the problem you´ve always had: thinking too much to live in the present, to really live in the truth, life."* - The truthcontest website

sjbrooksy45 : Finish the f-ing story! What happened?

David Andrews : From an American point of view, the take home message in the movie is that there are in our country brilliant people who never get a shot. I knew one. Unfortunately, he fell under a bus and was killed on his way to his job on the nightshift. The odds are--I will never meet another person as gifted.

Mike MMA : There are, on average, 183 sesame seeds on every Big Mac bun from McDonald's. I counted.

Full On Biscuits : I just passed geometry and going on into 11th grade.....I HAVE NO IDEA WHAT ANYONE IS TALKING ABOUT!!!!!!!!!!!!!!!!!!

Hanan Nasser : Reminds me of stereoisomers from organic chemistry.

DanClarky1 : Yeah but was it numberwang?

Alan Strong : Math is so easy... People(The one's who DON'T have learning disabilities) just don't try.

マリオ 94 : They look like network topologies

PMRstudios1 : "some of the words are greek." then says latin words....

MV Bros. : there is one thing that i think he may have overlooked. He tells us that he believes it is relitively easy and it wouldnt take MIT professers 2 years. while i agree with this statement, there is one part of this problem that is particually hard. He tells us the rules and then imediatly tells us there are 10 trees. MIT professers working this problem (assuming that this really happened) wouldnt have known that. They may have spent the first week figuring those ten out, and then spend the remaining 103 weeks looking for more answers and not relizing there wernt any more.

Hantaa : I seems like anyone who was taught about basic organic chemistry could solve this.

SmileyMPV : Fun fact: Only for n=3 there exist no irreducible trees.

gp5 : This guy's accent makes me think he's about to say "Do I make you horny baby?! Do I?? Yeaaaaaah"

Vitor Vilasanchez : "and that's a guy with a funky afro" best quote EVER!

Nicolas Zunker : i feel like this branch of mathematics (if youll pardon the pun) comes up a lot in organic chemistry, would i be right in that assumption- and what is it called?

Olivor Holman : Those trees brought back horrific memories of organic chemistry...

Ziggy Stardust : 2 years for this problem? I found them all in less than 20 minutes.

BubuSnow93 : Pheraps it's because I knew there were 10 solutions it was extremely easy, just assign a "hierarchy" to the points and it just takes 15 minutes or so to draw em all :) https://dl.dropboxusercontent.com/u/98051460/11024b7c-c79b-41d4-a622-ee6dbbe61af1.jpg

Jasmadi Syah : Yes this is easy, and its funny how hard for you guys to realize this is not the correct problem that took MIT lecturers 2 years to solve. This is the later one.

123 456 : for anyone who knows,good will hunter has the best musician ever as the main song writer for the movie

Jose Guevarra : Prove that you drew ALL OF THEM!

Tom Tom : Maths in movies are always ridiculous. They love to have sigmas (sum) on blackboards and some integrals but most math in movies are either meaningless or terribly easy .

David Winsemius : Cute. But the American student came late to a regular day's class (not an exam) and thought it was a homework problem. His name was George Dantzig and the professor was Jerzy Neyman. The paper was accepted in 'The Annals of Mathematical Statistics'.

D Kahn : The best kind of Professor, is the kind that is looking for students smarter than them, and wants to learn from them.

Leonie V : The pigeon wallpaper is arguably the best part of this video  :D

Christopher Sewell : When Dr. Grime describes the first type of banned transformation, he is actually showing something called graph isomorphism. Two graphs are isomorphic if there exists a mapping from the vertices of one graph to another which preserves the edges between them. Now before you really understand a homeomorphism, I believe it is first necessary to understand the concept of an elementary subdivision. Note how Dr. Grime goes from the first graph to the second banned graph by deleting the middle edge and replacing it with a vertex and two edges to reconnect the graph. This process is called an elementary subdivision. Finally, we say two graphs are homeomorphic if they can both be obtained by elementary subdivisions of some other graph. For a more complete introduction to graphs and trees check out "Discrete and Combinatorial Mathematics" by Grimaldi. In all honesty, you could begin reading this book with a basic understanding of high school mathematics.

TheYesDave : 1 MAIN NODE - x1 2 MAIN NODES - x3 (2,6) (3,5) (4,4) at ends - NO MORE POSSIBLE 3 MAIN NODES - x2  ONE EXTRA ATTACHED TO CENTRAL, TWO ENDS (2,4) (3,3) at ends - NO MORE POSSIBLE                - x1 TWO EXTRA ATTACHED TO CENTRAL, (2,3) at ends                - x1 THREE EXTRA ATTACHED TO CENTRAL (2,2) at ends 4 MAIN NODES - x1 ONE ATTACHED TO EACH CENTRAL ON SAME SIDE, (2,2) at ends                - x1 ONE ATTACHED TO EACH CENTRAL ON OPPOSITE SIDES, (2,2) at ends Actually quite easy, assuming I got it right. It must have taken ages because formal mathematical proof is a bitch. n=10 is important because for anything below this you can't get two central nodes meaning you can't have two main nodes sandwiched between two others meaning you can't get the opposite side thing going on so it is straightforward for n=9. If you draw these out you can see that there is no possible way that there are more, but try turning that into a formal proof, even if you know what holy-o-somethingy tree things are. For n=11 you can't get 5 nodes in a row so it's no more complicated.

themangiant : He didn't say that it took 2 years to draw them, but that it took 2 years to prove. I'm not a mathematician but I took that to mean that it took them 2 years to prove that those are the only possible trees with those parameters.

Lucija Magdić : When I was a child I watched that movie like 100 times and was always fascinated by the sketches with dots but I couldn't figure out what they were. I tried looking it up online but nothing. Then I became math student and one day this graph appeared in graph theory lesson and I was like THAT'S IT!!!! Best day ever 😊🎉

whatfireflies : 2 years? I just solved it in 10 minutes. I drew the only tree of this kind with N=4; then the only one with N=5; 2 with N=6; 2 with N=7; 4 with N=8; 5 with N=9; by that time I had developed my own method to sort them and I drew the 10 trees with N=10. Little fun problem! Easier than most crossword puzzles! Hollywood is the worst.

mobileradiofitter : If its size 10 trees, I notice that each pattern has only 9 segments. wouldnt that be size 9 ?

Aquifer's Hiraeth : It is surprisingly easy and simple! Did all ten no problem.

Michael McNamara : XD he could be a better Will Hunting