Max is a virtual character in a particular 2D game. He has the choice of functions (curve) to walk on to collect coins.
Which function is the most coin-to-distance efficient for him to take? (Meaning which function should he walk to gain more coin in a unit distance?)
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The arc length of Road 1 is infinite, where as the arc length of Road 2 is finite. You could calculate it out, or just observe the graphs points at x = 0 (in particular) for Road 1 and x = 0, pi/3 for road 2 and get an idea for the lengths. Hence, Road 2 is better.