Jump to content
BrainDen.com - Brain Teasers
  • 0

Roads can curve too


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)?

  • Upvote 1
  • Downvote 1

Share this post

Link to post
Share on other sites

3 answers to this question

  • 0

a) 3

b) y = (-5/6)x3 + (15/2)x2 - (62/3)x + 21
c) No. But it does go through (1,7)

I tried solving for the coefficients of a quadratic using gaussian elimination
without success, as the system of linear equations was inconsistent. When I
did the same thing with the coefficients of a cubic, I found the system to be
consistent with the coefficients (-5/6), (15/2), (-62/3), and 21. Previously,

I had erred in solving the cubic case and went on to the quartic with success.

The quartic I had in post #2 is the smallest degree monic polynomial that does

the job. Monic, however, was not a requirement.

Share this post

Link to post
Share on other sites
  • 0

a) 4

b) y = x4 - (89/6)x3 + (157/2)x2 - (524/3)x +141

c) No. But it does go through (1,31)

care to explain your approach?

Share this post

Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

  • Recently Browsing   0 members

    No registered users viewing this page.