Thread: shortest distance

I'm unsure of how to do this homework problem, so if someone could help me out, I'd appreciate it!!!

Suppose you live at the point (7, 44) and you go to school at the point (2, 51). How many shortest paths are there between home and school?

There is a diner at (5, 48) and a pet shop at (3, 50). How many shortest paths are there from home to school that go past both the diner and the pet shop? And how many shortest paths go past neither the diner and the pet shop?

Thank you!

Originally Posted by faure72

I'm unsure of how to do this homework problem, so if someone could help me out, I'd appreciate it!!!

Suppose you live at the point (7, 44) and you go to school at the point (2, 51). How many shortest paths are there between home and school?

I am not sure what the question is. The shortest path between two points is a staight line (on a plane). However there might be some restriction on it, in that case you seek a geodesic, is that what you want?

Originally Posted by ThePerfectHacker

I am not sure what the question is. The shortest path between two points is a staight line (on a plane).

It seems to me that is question is about the city-block metric.
Therefore we are counting pathways in a grid.
A shortest path is one that does not backtrack.

Oh don't worry about it. I figured it out. Thanks, though!

I had another question, though, in the the "Trees question" thread if someone could please help me with that, I would be so grateful.