You have to click on my thing to see it its a picture :)

Question

anonymous · Answer

attachment

perl · Answer

downloaded!

anonymous · Answer

You might be able to answer 58(a) with an inequality... all routes must be equal to or longer than some distance.

anonymous · Answer

Oh... actually, it looks like that is part (c).  Not sure what part (a) means.

anonymous · Answer

okay

anonymous · Answer

For 58b, you just need to list and then count the routes... no math, just observation.

Portland, Las Vegas, Tucson
Portland, San Diego, Tucson
Portland, Las Vegas, Seattle, Boise, San Diego, Tucson
Etc

anonymous · Answer

okay :) sounds good is that what they are

anonymous · Answer

there are more, that was just a start.  Actually, according to part (a), no route can have more than one layover, so my 3rd route above isn't "legal".

I think 58a is just asking for a written statement (like in words, not math)... such as "Any route from Portland to Tucson must be..."

anonymous · Answer

The inequality for part c will have the minimum distance (probably the direct Portland-Tucson route), and also the maximum distance... the longest route with only one layover.

anonymous · Answer

and how do you do the inequality