Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I came across this problem in a maths exam. I solved this by taking that a light ray passes in such a way that it takes least path. But as this was a maths exam, i was wondering if it can be solved using maths?

Let $A=(0,1)$ and $B = (1,1)$ in the plane $\mathbb{R}^{2}$. Determine the length of the shortest path from A to B consisting of the line segments AP; PQ and QB, where P varies on the x-axis between the points $(0, 0)$ and $(1, 0)$ and Q varies on the line $y = 3$ between the points $(0, 3)$ and $(1, 3)$

share|cite|improve this question
The reflection argument is mathematics, not Physics. One can set it up as a two variable minimization problem, then Lagrange multipliers, but that is a lot uglier. – André Nicolas Jan 28 '13 at 18:04
@Phani Raj I noticed that you've accepted only one answer out of sete questions you've asked. If you get a satisfying answer to a question, you should accept your favorite answer. – Git Gud Jan 28 '13 at 20:52

Consider A' and B' obtain by reflection i.e. A'=(0,-1), B'=(1,5). Then you consider any path APQB and notice that its length is equal to A'PQB'. But such a length should not be larger than the distance between A' and B' and since the points P and Q that you found give equality, they are the minimum.

share|cite|improve this answer

You Can try using Cauchy Schwarz inequality.

share|cite|improve this answer

Your Answer


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.