I've seen it before - 9

Geometry Level 4

A man starts from a point P ( 3 , 4 ) P(-3,4) and reaches point Q ( 0 , 1 ) Q(0,1) touching x axis x\text{ axis} at R ( α , 0 ) R(\alpha,0) such that P R + R Q PR+RQ is minimum, then find the value of 5 α 5|\alpha|


Note

You can find more such problems here


The answer is 3.

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

Chew-Seong Cheong
Oct 27, 2014

The shortest path is one that traveled by light starting from P ( 3 , 4 ) P (-3,4) reflected by x a x i s x-axis , the mirror, at R ( α , 0 ) R(\alpha, 0) and ending at Q ( 0 , 1 ) Q (0, 1) . Therefore the angle of incident θ i = \theta_i = angle of reflection θ r \theta_r .

Therefore, tan θ i = tan θ r \quad \tan {\theta_i} = \tan {\theta_r}

3 α 4 = α 1 3 α = 4 α 5 α = 3 \Rightarrow \dfrac {3-|\alpha|}{4} = \dfrac {|\alpha|}{1} \quad \Rightarrow 3-|\alpha| = 4|\alpha| \quad \Rightarrow 5|\alpha| = \boxed {3}

This problem can also be solved by Euler principle of least action which originated from Fermat principle of least time which postulates that "light travels between two given points along the path of shortest time." (http://en.wikipedia.org/wiki/Principle of least_action)

The image of the Q as reflected by y=0, is (0, - 1). Line length ( - 3,4)-(0, - 1) is the shortest and intersect y=0 at ( α , 0 ) . T h e l i n e i s y = 4 ( 1 ) 3 0 x 1 , i n t e r s e c t y = 0 , a t ( 3 5 , 0 ) . 5 α = 5 3 5 = 3. (\alpha,0).~ The~ line~ is~ y= \dfrac {4 - ( - 1)}{ - 3 - 0}x - 1,~ intersect~ y=0,~at~( -\dfrac 3 5,0).\\ \therefore~5|\alpha|=5*|-\dfrac 3 5|=3.

Vivek Rai
Dec 15, 2014

Here we can use calculus, to minimize the sum of distances PR and RQ, first find out the sum of distances, that will be in terms of \alpha. now differentiate it once wrt \alpha and equate it to zero. you will find the two values of \alpha. one will be positive and other will be negative. for (PR+RQ) to be minimum the negative value will be favourable for the given condition.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...