Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

enter image description here

Find the shortest distance from A to D given that one must at least touch the BC once

This is a open type question, better use some simple methods i wanna know more different kind of problem solving skills for this question, the more simple the methods the better

share|improve this question
1  
What have you tried? –  JavaMan Sep 29 '12 at 4:43
    
well, actually, i have solved this question but i wanna know more problem solving techniques to this question –  Mathematics Sep 29 '12 at 4:45
    
Better with some easy method without using any differentiation –  Mathematics Sep 29 '12 at 4:46
2  
If you have solved the problem then maybe you should edit your solution into the question so we don't waste our time telling you things you already know. –  Gerry Myerson Sep 29 '12 at 5:45
    
@Mathematics: Photons are tiny but their mathematical abilities should not be underestimated. They know that to minimize the path length, one should make the angle of incidence equal to the angle of reflection. –  André Nicolas Sep 29 '12 at 21:01
add comment

1 Answer

Hint: Reflect $CD$ in line $BC$. Then $D$ goes to say $D'$. Draw $AD'$.

share|improve this answer
    
Yup, this is what i use to solve this question, but can you solve with with different methods? –  Mathematics Sep 29 '12 at 7:06
    
Because you asked for "without differentiation" in a comment, I assumed that the way you had done it was the standard calculus way. –  André Nicolas Sep 29 '12 at 14:57
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.