Mirror, Mirror

Geometry Level 5

The minimum possible perimeter of a triangle with one vertex at ( 3 , 9 ) (3,9) , one anywhere on the y y -axis and one anywhere on the line y = x y = x is a b a\sqrt{b} , where a a and b b are positive coprime integers and b b is square free. Find a + b . a + b.


The answer is 11.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

3 solutions

Let A A be the vertex ( 3 , 9 ) (3,9) , B B be the vertex on the y y -axis and C C be the vertex on the line y = x y = x . Also let D ( 3 , 9 ) D(-3,9) be the reflection of A A in the y y -axis and E ( 9 , 3 ) E(9,3) be the reflection of A A in the line y = x y = x . Then A B = B D AB = BD and A C = C E AC = CE , and thus the perimeter of Δ A B C \Delta ABC is equal to D B + B C + C E . DB + BC + CE.

But the shortest distance between two points is a straight line, so

D B + B C + C E D E = ( 9 ( 3 ) ) 2 + ( 3 9 ) 2 = 180 = 6 5 . DB + BC + CE \ge DE = \sqrt{(9 - (-3))^{2} + (3 - 9)^{2}} = \sqrt{180} = 6\sqrt{5}.

This minimum can be obtained by then choosing B B and C C as the points of intersection of the line D E DE with the y y -axis and the line y = x y = x , respectively. This gives us the points B ( 0 , 15 2 ) B(0,\frac{15}{2}) and C ( 5 , 5 ) C(5,5) . The reader can confirm that this will yield a perimeter for Δ A B C \Delta ABC of 6 5 6\sqrt{5} .

The desired sum is then 6 + 5 = 11 6 + 5 = \boxed{11} .

Comment: This problem is an adaptation of a Putnam contest question.

Hi Brian, here is a video solution I had made few years back that explains why the reflection is minimum path and how it is related to ellipses with two points of the triangle as foci and the third one as a point where the mirror is tangential to the ellipse. Thought you might like it:

https://www.youtube.com/watch?v=0Ei9kjCd_SE

Ujjwal Rane - 6 years, 4 months ago

Log in to reply

That was an excellent video, Ujjwal. Thanks for sharing it. Envisioning the vertices as foci was a revelation. :)

Brian Charlesworth - 6 years, 4 months ago

The title sounds like a reference to the movie snow white. This is not related but it's interesting to mention....

Julian Poon - 6 years, 4 months ago

Log in to reply

Yes, I suppose it does. For me it was a reference to a Star Trek episode. :)

Brian Charlesworth - 6 years, 4 months ago

Elegant solution

Janardhanan Sivaramakrishnan - 6 years, 4 months ago

Can this 'thing' be extended to a quadilateral or say n sided polygons?

Alok Sharma - 6 years, 4 months ago

Log in to reply

Good question. I'll have to think about that.

Brian Charlesworth - 6 years, 4 months ago

Log in to reply

SPOILERS

A similar solution can be found for general n-sided polygons and any set of n lines. Simply take the starting point, reflect it about each line in sequence, until it is reflected off every single line. Then, draw a line from the new starting point to the endpoint, and you have your shortest distance.

Daniel Liu - 6 years, 4 months ago

Short answer is yes. But you might need to get creative about the way you reflect about each of these points.

Here's a similar problem to think about. Given any triangle, we take 3 points (one on each side). What is the minimum possible perimeter of this triangle of 3 points? How do you demonstrate (easily) that this is the minimum?

Calvin Lin Staff - 6 years, 4 months ago

Log in to reply

Calvin, do you have the solution to this? I got that triangle by joining the feet of the three altitudes on the sides. It also follows the 'reflection' rule! But this will obviously work only for acute angled triangles. For obtuse triangles, such a triangle degenerates into the shortest altitude doubled back on itself. Which is the shortest side in case of a right angle triangle. Is this correct? @brian charlesworth could you check this?

Ujjwal Rane - 6 years, 4 months ago

Log in to reply

@Ujjwal Rane Yes, for a non-acute triangle the least perimeter triangle would be degenerate, as you've described. The acute triangle question actually has a name: Fagnano's Problem .

Brian Charlesworth - 6 years, 4 months ago

Log in to reply

@Brian Charlesworth Thanks for confirming Brian! And thank you for the link to Fagnano's Problem. The learning never stops on Brilliant! :-)

Ujjwal Rane - 6 years, 4 months ago

Such an awesome solution after a long time

Ankur Tiwari - 6 years, 4 months ago

Rajen Kapur
Jan 29, 2015

Reflection of V(3,9) in y = x is (9,3). Reflection of (9,3) in y = 0 is (-9,3). Now its distance from V gives minimum perimeter. The tell-tale title is a pointer to the solution. It is a Brilliant extension of my problem "The minimum you can do."

Yes, the title was a very strong hint, but I couldn't resist, as "Mirror, Mirror" is the title of my favorite Star Trek episode. :)

I remember your problem; it does indeed follow the same concept as this one. That's one of the beauties of mathematics; the same idea can come disguised in so many ways.

Brian Charlesworth - 6 years, 4 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...