# Shortest distance around a pyramid

Transcript:

The diagram shows a square based pyramid with base PQRS and vertex O. All the edges are length 20 meters. Find the shortest distance, in meters, along the outer surface of the pyramid from P to the midpoint of OR.

The only way I have been able to solve this question is using a computer and the paper is non calculator, so there must be a faster, better solution.

My solution is creating a point X on OQ and labelling the midpoint of OR as M, and setting $$\theta = OPQ$$. I then calculated $$PX + PM$$ in terms of $$\theta$$ and found the minimum point of this function, in order to find the shortest possible distance. Finding the minimum point would be nowhere near possible under time constraint without a computer.

I have included the correct answer, so it is the working I am looking for.

D $$10\sqrt7$$

Hint:

The distance has to be a straight line along the net of the pyramid. There are two options:

The first line has lenght $$10\sqrt{7+2\sqrt{3}}$$, and the second one has $$10\sqrt{7}$$, which is the smaller one.

• I'd also suspect you can't dig under the pyramid – Zereges Jul 11 at 22:11
• Minor nitpick: Is it allowed to talk about the net of the pyramid? – Eric Duminil Jul 12 at 7:57
• Question: how do you reason about shapes that can not be flattened like such? – orlp Jul 12 at 11:01
• @orlp A curve of shortest distance which connects two points on a curved surface is called a geodesic. Finding geodesics is in general nontrivial and involves solving systems of differential equations. – mechanodroid Jul 12 at 11:07
• Supplementary question: is it true for all square-based pyramids, regardless of dimensions, that the shortest route will never involve "digging under" the base? – Michael Kay Jul 12 at 11:08

Draw the net of the pyramid and use the cosine rule.

• How do you know this is shorter than going through the square face? – JiK Jul 12 at 10:34
• @JiK, isn't it obvious? The hypotenuse of that right triangle is longer than 20 (longer than the length of the equilateral triangle) – Seyed Jul 12 at 11:10
• Interestingly, if base length is $1$ and side length is $2$, the shortest route will be the one along the square face. – mechanodroid Jul 12 at 11:38
• @JiK It isn't necessary to consider the square face as the problem statement talks about the outer surface of the pyramid. The way pyramids are usually displayed, a here, makes the outer surface not contain the base, which is the square. – Ingix Jul 13 at 10:24
• @Ingix I don't understand. The outside of the square face is in the outer surface of the pyramid. How does the way it's displayed change it? Why can you use the PSO face, which is also hidden, but not the square face? – JiK Jul 13 at 13:30

Hint: Draw the net diagram of the square pyramid and the you will find two points that are mid-point of $$OR$$. As you know that, minimum distance between any two points is the straight line joining them, just connect $$P$$ and midpoint of $$OR$$ by a straight line. Then just find the length of this line and exclude the length of this line that goes out of the net diagram. This length of line will be minimum length. Why?

Note: You can choose any one of the two midpoint because since the diagram is symmetric, the two lengths will be the same.

Cut along OQ and OR with a scissors, fold out that face to put the faces OPQ and OQR in one plane. Then the shortest path is a straight line from vertex P to the midpoint M of an opposite side of a 60-120 rhombus, I think.