Explaining a famous movie problem from @scientific_american

Name: Explaining a famous movie problem from @scientific_american
Uploaded: 2026-05-10T18:14:21.000Z
Duration: 106 s
Channel: scientific_american
Description: The creator debunks the difficulty of the central math problem from the movie "Good Will Hunting." She breaks down the complex mathematical jargon into simple terms, explains the concepts of "trees," "nodes," and "homeomorphically irreducible," and then provides a step-by-step visual demonstration by drawing all ten possible solutions on paper.

The creator debunks the difficulty of the central math problem from the movie "Good Will Hunting." She breaks down the complex mathematical jargon into simple terms, explains the concepts of "trees," "nodes," and "homeomorphically irreducible," and then provides a step-by-step visual demonstration by drawing all ten possible solutions on paper.

Creator: @scientific_american on Instagram

Transcript

Did you know that mathematicians actually kind of hate Good Hunting? The entire plot of the movie revolves around Matt Damon being a math genius for solving this problem that really isn't all that hard. Pretty much anyone can do it with a few minutes of dedicated doodling. Let me show you how. So this was the problem. Draw all homeomorphically irreducible trees of size n equals 10. This may sound complicated, but it's actually the language itself that makes it hard. Once you translate all the te

Topics: Science, Movies, Education

2,036,737 views