A couple weeks ago, I created a question requiring the shortest path. Now for this question, assume that roads can be curved. We need a road that can pass through the following four cities (location of each city listed as coordinates): Los Angeles (3,4), Newport Beach (5,1), Pasadena (4,5), Santa Monica (2,3).

a) What's the smallest degree polynomial y=f(x) that will pass through all four cities? . . .

b) What is the exact equation of this polynomial? (Hint: use fractions not decimals)

c) Would this road go through Chatsworth at (1,6)?

Posted

A couple weeks ago, I created a question requiring the shortest path. Now for this question, assume that roads can be curved. We need a road that can pass through the following four cities (location of each city listed as coordinates): Los Angeles (3,4), Newport Beach (5,1), Pasadena (4,5), Santa Monica (2,3).

## Share this post

## Link to post

## Share on other sites