Saturday, March 29, 2014

Challenge Problem I - How Can I Get There?

DUE: Friday 4th April @8:30 am.

How Can I Get There?
How many different paths that move along integer valued horizontal or vertical lines are there that move east or north that join (0, 0) to (4, 4)? Show all paths and calculate the taxi cab distance of each path.Determine which path is most efficient? Justify your response.


(A typical example of such a path is shown with thick segments above.)

3 comments:

  1. Nalo do you want it on graph paper?? and do you want us to explain what we did??

    ReplyDelete
  2. Destiny she said you don't have to explain but you can either show your work (the paths taken ) or you can write out your steps individually.

    ReplyDelete
  3. Oh yeah guys remember that whatever path you take to get to coordinates (4,4), you can use the same path but just change the directs..

    Example: 2 units right, 2 units up, 1 unit right, 2 units up.
    2 units up, 2 units right, 1 unit up, 1 unit right.

    ReplyDelete