Since the figures are symmetrical in all four quadrants, the problem is to be worked in the first quadrant only, where x ≥ 0 and y ≥ 0 .
The two figures, respectively, have the equations: ( 2 x 1 ) 2 + ( 3 y 1 ) 2 = ( 2 × 3 ) 2 and ( 3 x 2 ) 2 + ( 4 y 2 ) 2 = ( 3 × 4 ) 2 .
The problem is to find the minimum distance between the figures. The answer will have the form of a relatively prime fraction possibly under a square root. The answer will be the concatenation (i.e., list altogether) of a 1 if there is no square root is required and a 2 if a square root is required, the numerator of the fraction, and the denominator of the fraction. If the answer were 5 1 4 7 and this is not the answer, then the number to be entered would be 24751. If the answer were 1 and this also is not the answer, then the number would be 111 because a fraction is required and in that case would be written as the answer over 1. If the answer were 2 0 1 9 and again this is not the answer, then the number to be entered would be 11920, Last example, 1 0 0 1 9 9 9 gives 29991001.
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.
For x 1 of f ( x ) and x 2 of g ( x ) which yield the minimum distance, there shall be 2 equations:
( 1 ) f ′ ( x 1 ) = g ′ ( x 2 ) since slopes at intersections should be equal
( 2 ) f ( x 1 ) + f ′ ( x 1 ) x 1 = g ( x 2 ) + g ′ ( x 2 ) x 2 since y intercepts for the lines should be equal
For this problem, (1) means 3 9 − x 1 2 − 2 x 1 = 4 1 6 − x 2 2 − 3 x 2
and (2) is 1 2 7 1 6 − x 1 2 = 6 5 9 − x 2 2
which both combined shall reduce to a quadratic equation in terms of x 1 2 .
The value is 5 9 1 7 2 9 and 7 1 6 1 7 2 9 for x 1 and x 2 respectively.
Plug them into ( x 1 − x 2 ) 2 + ( 3 2 9 − x 1 2 − 4 3 1 6 − x 2 2 ) 2 to obtain the distance.
Problem Loading...
Note Loading...
Set Loading...
( 2 x 1 ) 2 + ( 3 y 1 ) 2 = ( 2 3 ) 2 ∧ x 1 ≥ 0 ∧ y 1 ≥ 0 → 0 ≤ x 1 ≤ 3 ∧ y 1 = 3 2 9 − x 1 2
( 3 x 2 ) 2 + ( 4 y 2 ) 2 = ( 3 4 ) 2 ∧ x 2 ≥ 0 ∧ y 2 ≥ 0 → 0 ≤ x 2 ≤ 4 ∧ y 2 = 4 3 1 6 − x 2 2
The expression for the Euclidean distance is 9 5 x 1 2 − 2 x 2 x 1 + 1 6 7 x 2 2 − 9 − x 1 2 1 6 − x 2 2 + 1 3 .
The minimum distance is 3 5 3 4 for which the number to be entered as 23435.
Using the square of the Euclidean distance simplifies the computations and does not change the answer.
∂ x 1 ∂ ( 9 5 x 1 2 − 2 x 2 x 1 + 1 6 7 x 2 2 − 9 − x 1 2 1 6 − x 2 2 + 1 3 ) → 9 − x 1 2 1 6 − x 2 2 x 1 + 9 1 0 x 1 − 2 x 2
∂ x 2 ∂ ( 9 5 x 1 2 − 2 x 2 x 1 + 1 6 7 x 2 2 − 9 − x 1 2 1 6 − x 2 2 + 1 3 ) → − 2 x 1 + 8 7 x 2 + 1 6 − x 2 2 9 − x 1 2 x 2
Setting the expression as being equal to 0 and solving the simultaneous equations with additional constraints that x 1 ≥ 0 and x 2 ≥ 0 gives { x 1 → 0 , x 2 → 0 } , { x 1 → 1 2 1 7 5 , x 2 → 1 2 1 7 5 } , { x 1 → 5 9 1 7 2 9 , x 2 → 7 1 6 1 7 2 9 } .
Now the second derivative test is needed to determine whether any of these situations qualify.
∂ x 1 ∂ x 1 ∂ 2 ( 1 3 + 9 5 x 1 2 − 2 x 1 x 2 + 1 6 7 x 2 2 − 9 − x 1 2 1 6 − x 2 2 ) ∂ x 2 ∂ x 2 ∂ 2 ( 1 3 + 9 5 x 1 2 − 2 x 1 x 2 + 1 6 7 x 2 2 − 9 − x 1 2 1 6 − x 2 2 ) ∂ x 1 ∂ x 2 ∂ 2 ( 1 3 + 9 5 x 1 2 − 2 x 1 x 2 + 1 6 7 x 2 2 − 9 − x 1 2 1 6 − x 2 2 ) ( 9 − x 1 2 ) 3 / 2 1 6 − x 2 2 x 1 2 + 9 − x 1 2 1 6 − x 2 2 + 9 1 0 ( 1 6 − x 2 2 ) 3 / 2 9 − x 1 2 x 2 2 + 1 6 − x 2 2 9 − x 1 2 + 8 7 − 9 − x 1 2 1 6 − x 2 2 x 1 x 2 − 2
The discriminant is ( ( 1 6 − x 2 2 ) 3 / 2 9 − x 1 2 x 2 2 + 1 6 − x 2 2 9 − x 1 2 + 8 7 ) ( ( 9 − x 1 2 ) 3 / 2 1 6 − x 2 2 x 1 2 + 9 − x 1 2 1 6 − x 2 2 + 9 1 0 ) − ( − 9 − x 1 2 1 6 − x 2 2 x 1 x 2 − 2 ) 2 .
Evaluating the discriminant for each of the three points gives { − 3 6 1 , − 9 0 7 2 1 4 4 5 , 5 3 1 3 6 8 3 8 1 } .
Only the last point evaluated to a positive, which is what is required for a minimization. Therefore, the minimum occurs at x 1 → 5 9 1 7 2 9 , x 2 → 7 1 6 1 7 2 9 . The cooresponding y s are: { 5 4 1 7 4 1 , 7 9 1 7 4 1 } .