Alert icon
We're changing our privacy policy. This stuff matters.  Learn more  Dismiss

Good Will Hunting Maths Problem

Loading...

Sign in or sign up now!
166,791
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Sep 25, 2008

The problem Matt Damon's character solved in 'Good Will Hunting' - Homeomorphically Irreducible Trees of degree ten. The problem sounds complex but is actually very easy. Robin Wilson, Gresham Professor of Geometry, explains the problem and shows the simple solutions.

This is the 21st part of 'A Millennium of Mathematical Puzzles'.
The full lecture is available (in 24 parts) here on YouTube, or it can be downloaded (like all of our lectures) in its complete form from the Gresham College website, in video, audio or text formats:
http://www.gresham.ac.uk

Gresham College has been giving free public lectures since 1597. This tradition continues today with all of our five or so public lectures a week being made available for free download from our website.

Category:

Education

Tags:

License:

Standard YouTube License

Link to this comment:

Share to:

Top Comments

  • Maybe in the movie he was saying it took them 2 years because they had to figure out how many possible trees there are. Starting people off saying "there are 10 trees, find them" is a lot different than trying to find every possible tree without knowing how many there actually are because it hasn't been done before.

  • I don't give a shit about the problem. I just love the film.

see all

All Comments (213)

Sign In or Sign Up now to post a comment!
  • 1:45....and joke bombs...ouch

  • @monoxxide007 No, you can't have 2 branches. You just need to have 1 or more than 2.

  • i got here from cops..... wtf?

  • and technically the star one is wrong he said one point can not have more than one branch the center dot has many if you look at it from a different point of view

  • @TJRy12921

    Exactly. There is a difference between finding the solution and proving that there can ONLY be that solution.

  • The professor says that the problem took more than 2 years to prove, not solve. Completely different...

  • I got one for ya....How about you draw all the homeomorphically irreducible trees between 0 and n="these nuts".

  • Pretty lame question. Would be cool if he asked to prove how many different trees there would be, that'd be a good question.

  • functional analysis?

  • wait a sec this is linear algebra? i was going to guess differential geometry or electrical engineering applications

View all Comments »
Loading...

0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more