Let R be the region in the first quadrant outside of the circles x 2 + y 2 = 4 and x 2 + ( y − 3 ) 2 = 1 but inside the circle x 2 + ( y − 1 ) 2 = 9 .
The largest circle that can be inscribed in R has radius b a , where a and b are positive coprime integers. Find a + b .
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.
@Ujjwal Rane , we really liked your comment, and have converted it into a solution. If you subscribe to this solution, you will receive notifications about future comments.
Let A be the center of the circle x 2 + y 2 = 4 , B be the center of the circle x 2 + ( y − 1 ) 2 = 9 , C be the center of the circle x 2 + ( y − 3 ) 2 = 1 and D be the center of the sought after inscribed circle. Also, let r be the radius of the circle with center D . Then, using the Cosine rule on Δ A C D we have that
∣ A D ∣ 2 = ∣ A C ∣ 2 + ∣ C D ∣ 2 − 2 ∗ ∣ A C ∣ ∗ ∣ C D ∣ ∗ cos ( ∠ A C D )
⟹ ( 2 + r ) 2 = 9 + ( 1 + r ) 2 − 6 ( 1 + r ) cos ( ∠ A C D )
⟹ cos ( ∠ A C D ) = 3 ( 1 + r ) 3 − r .
Next, using the Cosine rule on Δ B C D and noting that ∠ B C D = ∠ A C D , we have that
∣ B D ∣ 2 = ∣ B C ∣ 2 + ∣ C D ∣ 2 − 2 ∗ ∣ B C ∣ ∗ ∣ C D ∣ ∗ cos ( ∠ A C D )
⟹ ( 3 − r ) 2 = 4 + ( 1 + r ) 2 − 4 ( 1 + r ) cos ( ∠ A C D )
⟹ cos ( ∠ A C D ) = 1 + r 2 r − 1 .
Equating the two expressions for cos ( ∠ A C D ) gives us
3 ( 1 + r ) 3 − r = 1 + r 2 r − 1 ⟹ 3 − r = 6 r − 3 ⟹ 7 r = 6 ⟹ r = 7 6 .
Thus a + b = 6 + 7 = 1 3 .
I solved it and got a 'Correct!' so looked up the solution and got a 'Not answered' status. Anyway, could we use Stewart's Theorem on triangle ACD here?
If r is the radius we seek, then A B = 1 ; B C = 2 , A D = r + 2 ; B D = 3 − r ; C D = r + 1
Stewart's theorem gives 3 × 2 × 1 + ( 3 − r ) 2 × 3 = ( r + 1 ) 2 × 1 + ( r + 2 ) 2 × 2 6 + 2 7 − 1 8 r = 2 r + 1 + 8 r + 8 2 4 = 2 8 r giving r = 7 6 .
Log in to reply
Yes, Stewart's Theorem is perfect for this problem. You've mentioned this theorem before, and now that I've seen your application of it I will be more likely to make use of it in the future. :)
P.S.. I hope that the 'Not answered' status has corrected itself. If not, then it might be worth mentioning to Calvin in case there is a glitch in the system.
Log in to reply
Yes Brian, Stewart's theorem is pretty handy and I owe it to Brilliant! (they don't teach that in schools :-( I will let Calvin know about a possible bug or possibly a (connectivity + browser) state that leads to it.
I think you should probably make a note on how to solve these 'types' of problems because I don't think this problem is as hard as rating suggests(no offence sir) probably due to less number of solvers and high number of viewers, its just a suggestion and observation from my side :)
Log in to reply
The solver-to-views ratio is fairly high, so I'm not sure why the rating is as high as it is. I thought I assigned it a level 4 rating when I posted the question, but it was late and I may have chosen level 5 by mistake. Once there are more views and solvers I think that the rating will come down, (it should probably be worth about 175 points rather than the present 275 points; does that sound about right?). I'm not sure what you mean by "make a note on how to solve these 'types' of problems". When I make these "fit the circle" types of problems I try to post a slightly different solution method for each, and for past problems others have posted alternate methods as well. I suppose that I could form a set of all the problems of this type that I have posted.
I also had in mind a more difficult problem, which involved finding the radii of the sequence of circles as we move clockwise around the x 2 + y 2 = 4 circle within region R , (extended down to the 4th quadrant). I wasn't able to find a simple strategy to do this last night, so I just posted this problem instead.
Log in to reply
Yes, I have seen that your solutions are always different but I solved similarly as yash,
Distance between centre equals sum of radii for externally tangent
Distance between centres equals difference of radii when internally tangent
Most of the problems I have solved with these 2 equations only
Hey but I remember that you have posted similar problem on sequence of circles around a circle while radius decrease harmonically(I couldn't solve that -_-) and about the points under 200 is okay :)
Log in to reply
@Krishna Sharma – Yes, that is an effective method. I'll have to think up a "circle" problem that can't be solved using these two steps and then dedicate it to you. :) The harmonically decreasing circle problem would qualify, (it was one of my favorites), so I'll follow through on the more difficult problem I proposed above to see if will qualify as well.
As for the point level for this problem, it's still going up for some reason. :P Not much I can do about that now.
Let r be the radius of circle C4.
C4 touches C1 internally, ⇒ 3 − r = h 2 + ( k − 1 ) 2 ⇒ r 2 − 6 r + 2 k + 8 = h 2 + k 2 ⟶ 1
C4 touches C2 externally, ⇒ 1 + r = h 2 + ( k − 3 ) 2 ⇒ r 2 + 2 r + 6 k − 8 = h 2 + k 2 ⟶ 2
C4 touches C3 externally, ⇒ 2 + r = h 2 + k 2 ⇒ r 2 + 4 r + 4 = h 2 + k 2 ⟶ 3
Solving equations 1. 2 and 3, we get r = 7 6 ,
Hence, answer is 6 + 7 = 1 3 .
Did the same. +1
Using Descartes circle theorem . Let r = 0 be the radius we are seeking, then 2 ( 4 1 + 9 1 + 1 + r 2 1 ) = ( 2 1 + 1 − 3 1 + r 1 ) 2 ⟺ ( r 1 − 6 7 ) 2 = 0 ⟺ r = 7 6 . Or in otrher words,
Proposition.- Let R be the set of real numbers, then are equivalents:
a) r = 7 6
b) r 1 = 6 7
c) ( r 1 − 6 7 ) 2 = 0
d) 2 ( 4 1 + 9 1 + 1 + r 2 1 ) = ( 2 1 + 1 − 3 1 + r 1 ) 2
Proof.-
a ) ⟺ b ) Trivial.
b ) ⇒ c ) If r 1 = 6 7 ⇒ r 1 − 6 7 = 0 ⇒ ( r 1 − 6 7 ) 2 = 0
c ) ⇒ b ) If ( r 1 − 6 7 ) 2 = 0 ⇒ ( r 1 − 6 7 ) ⋅ ( r 1 − 6 7 ) = 0 ⇒ r 1 = 6 7 .
Hence, so far, we have already proved a ) ⟺ b ) ⟺ c ) . Now
a ) ⇒ d ) Trivial (calculation)
d ) ⇒ c ) If 2 ( 4 1 + 9 1 + 1 + r 2 1 ) = ( 2 1 + 1 − 3 1 + r 1 ) 2 ⇒ 1 8 4 9 + 2 r 2 1 = ( 6 7 + r 1 ) 2 ⇒ r 2 1 − 6 r 2 ⋅ 7 + 3 6 4 9 = ( r 1 − 6 7 ) 2 = 0
q.e.d
Problem Loading...
Note Loading...
Set Loading...
If r is the radius we seek, then A B = 1 ; B C = 2 , A D = r + 2 ; B D = 3 − r ; C D = r + 1
Stewart's theorem gives 3 × 2 × 1 + ( 3 − r ) 2 × 3 = ( r + 1 ) 2 × 1 + ( r + 2 ) 2 × 2 6 + 2 7 − 1 8 r = 2 r + 1 + 8 r + 8 2 4 = 2 8 r giving r = 7 6 .