[ A ] denote the area of circle A . Suppose that 1 0 concentric circles O 1 , O 2 , … , O 1 0 satisfy [ O i ] > [ O i + 1 ] for all i = 1 → 9 . Also, a chord drawn in circle O 1 has the property that circles O 2 → O 1 0 cut it into 1 9 equal sections. The chord has length 2 0 1 4 , and [ O 1 ] + [ O 2 ] + [ O 3 ] + ⋯ + [ O 1 0 ] < 2 0 1 4 0 0 0 0
LetWhat is the largest possible integer value of the radius of O 1 0 ?
You are permitted to use a scientific calculator.
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.
Such a simple question . I didn't solve it!
Ah yes, Stewart's Theorem also works. Thanks for the solution!
Since the total chord length is 2014, half of this forms a right triangle with one side of length 1007, the other side vertical equal to the displacement of the secant line from the centers and hypotenuse r 10. How can r 10 be less than 1007? What am I missing or misunderstanding?
Log in to reply
r 1 0 is the smallest radius; r 1 is the biggest one.
For this problem, knowledge of Holditch's Theorem helps.
The length of each equally divided segment is 1 9 2 0 1 4 = 1 0 6 .
Let the radius of O 1 0 be r .
We have that [ O 9 ] = [ O 1 0 ] + area of annulus between the two circles .
By Holditch's Theorem, the area of the annulus is ( 1 0 6 ⋅ 1 ) ⋅ ( 1 0 6 ⋅ 2 ) ⋅ π .
Similarly, [ O 8 ] = [ O 1 0 ] + area of annulus between the two circles .
By Holditch's, the area of this annulus is ( 1 0 6 ⋅ 2 ) ⋅ ( 1 0 6 ⋅ 3 ) ⋅ π .
We continue on in this manner, until we find that [ O 1 ] + [ O 2 ] + ⋯ + [ O 1 0 ] = 1 0 [ O 1 0 ] + 1 0 6 2 π ( 1 ⋅ 2 + 2 ⋅ 3 + ⋯ + 9 ⋅ 1 0 ) .
Since [ O 1 0 ] = π r 2 , we have that 1 0 π r 2 + 3 7 0 7 8 8 0 π < 2 0 1 4 0 0 0 0 .
Solving for r gives that r < 5 1 9 . 8 9 2 , so our answer is 5 1 9 .
You should specify in the problem that you want an integer. For this problem I basically used median length theorem to calculate the individual radii starting at circle 9 → 1 in terms of the radius of circle 1 0 and ended up with the same equation that you had. Anyway this is another quality problem! Thank you..
Log in to reply
Ah shoot, how did I forget to add integer? Thankfully, the answer has to be an integer, so it was implied. I have fixed it now, thanks.
Also, glad you liked the problem! :)
Sorry for the kind of speedy and badly written solution. I did not have that much time to write it. I will try to make it better if I can find more time and remember to write it.
Some bits of computation involved though
let, r 1 0 = r and here, chord length of the smallest circle is x = 1 9 2 0 1 4 = 1 0 6 now, r 9 = r 2 + 2 x 2 r 8 = r 2 + 6 x 2 r 7 = r 2 + 1 2 x 2 r 6 = r 2 + 2 0 x 2 ................... According to the question, [ O 1 0 ] + [ O 9 ] + [ O 8 ] + [ O 7 ] + . . . . . . + [ O 1 ] < 2 0 1 4 0 0 0 0 = > π r 2 + π ( r 2 + 2 x 2 ) + π ( r 2 + 6 x 2 ) + . . . < 2 0 1 4 0 0 0 0 = > r 2 + ( r 2 + 2 x 2 ) + ( r 2 + 6 x 2 ) + . . . < π 2 0 1 4 0 0 0 0 = > 1 0 r 2 + x 2 { 2 + 6 + 1 2 + 2 0 + . . . + n ( n + 1 ) } < 6 4 1 0 7 6 1 . 1 0 7 7 = > 1 0 r 2 + x 2 n = 1 ∑ 9 n ( n + 1 ) < 6 4 1 0 7 6 1 . 1 0 7 7 = > 1 0 r 2 + x 2 ( 3 n 3 + n 2 + 3 2 n ) < 6 4 1 0 7 6 1 . 1 0 7 7 [ n = 9 ] = > 1 0 r 2 + 1 0 6 2 × 3 3 0 < 6 4 1 0 7 6 1 . 1 0 7 7 now, solving and considering integer value we get 519
Length of secant segment inside Circle i,
d ( i ) = d ( 1 − ( 2 ( i − 1 ) / 1 9 ) ) = 2 0 1 4 ( 1 − 2 ( i − 1 ) / 1 9 ) = 1 0 6 ( 2 1 − 2 i )
Since the normal to the secant from the center is equal for all circles,
r ( i ) 2 − ( d ( i ) / 2 ) 2 = c o n s t a n t , f o r i = 1 , 2 , . . . , 1 0
Therefore
r ( i ) 2 = c o n s t a n t + ( d ( i ) / 2 ) 2 , f o r i = 1 , 2 , . . . . , 1 0
π ∑ i = 1 1 0 ( r ( i ) 2 ) = 1 0 π ( c o n s t a n t ) + π s u m i = 1 1 0 ( ( d ( i ) / 2 ) 2 )
π ∑ i = 1 1 0 ( r ( i ) 2 ) = 1 0 π ( c o n s t a n t ) + π ( 5 3 ) 2 ( 4 4 1 ( 1 0 ) − 8 4 ( 1 0 ) ( 1 1 ) / 2 + 4 / 6 ( 1 0 ) ( 1 1 ) ( 2 1 ) ) < 2 0 1 4 0 0 0 0
c o n s t a n t < 2 6 7 4 7 9 . 1 1 0 7 7 4 1 5 4 4 1
r ( 1 0 ) = c o n s t a n t + ( d ( 1 0 ) / 2 ) 2 < 2 6 7 4 7 9 . 1 1 0 7 7 4 1 5 4 4 1 + ( 5 3 ) 2 = 5 1 9 . 8 9
Problem Loading...
Note Loading...
Set Loading...
We can use Stewart´s Theorem to find r 9 , r 8 , . . . . , r 1 in terms of r 1 0 . Then:
r 9 2 = r 1 0 2 + 2 ⋅ 1 0 6 2
r 8 2 = r 1 0 2 + 6 ⋅ 1 0 6 2
...
r 1 2 = r 1 0 2 + 9 0 ⋅ 1 0 6 2
Then
[ O 1 ] + . . . + [ O 1 0 ] = π ⋅ ( r 1 2 + . . . + r 1 0 2 ) = π ⋅ ( 1 0 ⋅ r 1 0 2 + 3 3 0 ⋅ 1 0 6 2 )
and solving
π ⋅ ( 1 0 ⋅ r 1 0 2 + 3 3 0 ⋅ 1 0 6 2 ) < 2 0 1 4 0 0 0 0
for r 1 0 , it gives that r 1 0 < 5 1 9 , 8 9 . So, the largest INTEGER possible for r 1 0 is 5 1 9 .