#Good will hunting math problem movie
d) How many can You create? Show all the nodesģ) Now tTy t0 do the same thing you did in question (2) but this time for and & nodes Hint: Watch the Movie and have fun. Nodes arc connected to at least one other node.ī) No cyeles are allowed and only one link is allowed between any tWo nodes: Most importantly_ no node can have degree of 2. 10 vertices) In the language of network science, the problem is t0 find of fully connected networks with [0 nodes and containing cycles Essentially we need to join ten nodes together such that: Only strong students would dare try and solve it The problem is:įind all homeomorphically irreducible trees of degree ten (i.e. Professor Gerald Lambeau come to the class and announces problem that has taken MIT professors years t0 solve: He boldly proclaims that the so-called gauntlet has been thrown down. c) Give list of all 3-steps walks from node t0 node 2Ģ) In the second problem (in the movie). The solution to the problem uses network analysis.Ī) Find the adjacency matrix A of the graph G b) Find the matrix giving the number of three-step walks for the graph G. As he is mopping floors he notices problem posted on board 45 4 challenge to math students. I) In the Movie, Good Will Hunting, the main character, Will Hunting: played by Matt Damon Janitor J1 university. Due Sunday, September [Sth, 2019 by [.59 p.m: (Submit on Webcourses and hard copy in class in next class after submission)