Why do these paths all have the same length?

2.3k Views Asked by At

In a high school book the author said these paths have all the same distance. Is that true? how to convince myself (and my students as well) they all have the same length?

6

There are 6 best solutions below

6
On BEST ANSWER

By a sequence of reflections of setions of each path ... each path can be shown to the same length as the red path.

enter image description here

1
On

All the angles appear to be right angles, and paths go in only two directions: let's call them N (up-and-right in the diagram) and E (down-and-right). Now imagine, for each path, moving all the E segments down the bottom, and all the N segments over to the right. You'll get the same path from A to B for all 4, and rearranging segments doesn't change the length.

Edit: Donald Splutterwit has posted a picture of exactly what I was describing.

0
On

Turn the picture by about $55^\circ$ clockwise, so that the paths are made of horizontal and vertical segments.

enter image description here

Then you will see that any of those paths is as long as it takes to move from $A$ to the 'right', all the way to the place 'right above $B$' and then move 'down' all the way to $B$ (darker black line added on the picture).

0
On

When I was 5th grade student or something like that, I couldn't understand how they could be equal in a similar question and one of my brothers showed me a figure as I drawed and I completely understand it when I saw that figure. The figure I attached is as same as that one and since I didn't want to mess up the original one, I showed it on path $I$ and $II$:

enter image description here

Note that same colored segments have the same length.

0
On

Translating vectors doesn't change their magnitude.

Or:

taxicab

The small red (green) vectors sum to the big red(green) vector.

0
On

I hope you defined that every path had endpoints A and B.

You may like to play 'architect' with your students. Define a 'step' in terms of rise and run. (where both are > 0 which you may elect not to do in the beginning). Then have them design their flight of stairs where individual steps may have variable rises and/or runs with the object of connecting the first and second floors of a building with parallel floors. Hopefully you or someone may illustrate a 1 or 2 step solution. Label bottom and top A & B. Generalize by comparing the sum of Rises,,, Sum of Runs.
You may elect to investigate the case where Rises and Runs ---> 0