Circles in Geometric Progression? 2

Geometry Level 3

As shown in the figure, both the red circle and the largest blue circle C 0 C_0 have a radius of 1 and are tangent to each other and to the base straight line. Let the second largest blue circle tangent to the red circle and C 0 C_0 and the base line be C 1 C_1 ; a next largest blue circle tangent to the red circle, C 0 C_0 , and C 1 C_1 be C 2 C_2 ; a next blue circle C 3 C_3 tangent to the red circle, C 0 C_0 , and C 2 C_2 ; and so on such that the blue circles continue infinitely.

If the total area of all the blue circles including C 0 C_0 can be expressed as:

π a + π b c \frac \pi a + \frac {\pi^b}c

where a a , b b , and c c are integers. Find a + b + c a+b+c .


The answer is 19.

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.

1 solution

Chew-Seong Cheong
Dec 19, 2019

Due to symmetry, the centers of all the blue circles except C 0 C_0 are on a straight line perpendicular to the base line and the line joining the centers of the red circle and C 0 C_0 . The length of this line from the base line to the contact point of the red circle and C 0 C_0 (or the line joining the two centers) is 1. Consider the n n th blue circle C n C_n with radius r n r_n , we have from the top of this line to the bottom.

( 1 + r n ) 2 1 + r n + 2 k = 1 n 1 r k = 1 Let S n = k = 1 n r k ( 1 + r n ) 2 1 = 1 r n 2 S n 1 Squaring both sides r n 2 + 2 r n = r n 2 2 r n + 1 4 S n 1 ( 1 r n ) + 4 S n 1 2 4 ( 1 S n 1 ) r n = 1 4 S n 1 ( 1 S n 1 ) r n = 1 4 ( 1 S n 1 ) S n 1 S n = 1 4 ( 1 S n 1 ) \begin{aligned} \sqrt{(1+r_n)^2 -1} + r_n + 2 \blue{\sum_{k=1}^{n-1} r_k} & = 1 & \small \blue{\text{Let }S_n = \sum_{k=1}^n r_k} \\ \sqrt{(1+r_n)^2 -1} & = 1 - r_n - 2 \blue{S_{n-1}} & \small \blue{\text{Squaring both sides}} \\ r_n^2 + 2r_n & = r_n^2 - 2r_n + 1 - 4S_{n-1}(1-r_n) + 4S_{n-1}^2 \\ 4(1-S_{n-1})r_n & = 1 - 4S_{n-1}(1-S_{n-1}) \\ r_n & = \frac 1{4(1-S_{n-1})} - S_{n-1} \\ \implies S_n & = \frac 1{4(1-S_{n-1})} \end{aligned}

Calculations reveal that S 1 = 1 4 , S 2 = 2 6 , S 3 = 3 8 , S_1 = \frac 14, S_2 = \frac 26, S_3 = \frac 38, \cdots . It appears that S n = n 2 ( n + 1 ) S_n = \frac n{2(n+1)} which can be readily proven by induction (see Note). Then r n r_n is given by:

r n = S n S n 1 = n 2 ( n + 1 ) n 1 2 n = 1 2 n ( n + 1 ) \begin{aligned} r_n & = S_n - S_{n-1} = \frac n{2(n+1)} - \frac {n-1}{2n} = \frac 1{2n(n+1)} \end{aligned}

And the total area of all blue circles is:

A = π ( 1 2 ) + n = 1 π r n 2 = π + n = 1 π 4 n 2 ( n + 1 ) 2 = π + π 4 n = 1 ( 1 n 2 + 1 ( n + 1 ) 2 2 n + 2 n + 1 ) = π + π 2 n = 1 1 n 2 π 4 π 2 Riemann zeta function ζ ( s ) = k = 1 1 k s = π 4 + π 3 12 and ζ ( 2 ) = π 2 6 \begin{aligned} A & = \pi (1^2) + \sum_{n=1}^\infty \pi r_n^2 = \pi + \sum_{n=1}^\infty \frac \pi{4n^2(n+1)^2} \\ & = \pi + \frac \pi 4 \sum_{n=1}^\infty \left(\frac 1{n^2} + \frac 1{(n+1)^2} - \frac 2n + \frac 2{n+1} \right) \\ & = \pi + \frac \pi 2 \blue{\sum_{n=1}^\infty \frac 1{n^2}} - \frac \pi 4 - \frac \pi 2 & \small \blue{\text{Riemann zeta function }\zeta(s) = \sum_{k=1}^\infty \frac 1{k^s}} \\ & = \frac \pi 4 + \frac {\pi^3}{12} & \small \blue{\text{and }\zeta(2) = \frac {\pi^2}6} \end{aligned}

Therefore a + b + c = 4 + 3 + 12 = 19 a+b+c = 4+3+12 = \boxed{19} .


Reference: Riemann zeta function

Note: To prove the claim S n = n 2 ( n + 1 ) S_n = \frac n{2(n+1)} is true for all n 1 n \ge 1 by induction

For n = 1 n=1 , S 1 = 1 4 ( 1 0 ) = 1 4 S_1 = \frac 1{4(1-0)} = \frac 14 . Therefore the claim is true for n = 1 n=1 . Assuming the claim is true for n n . then

S n + 1 = S n + r n + 1 = S n + 1 4 ( 1 S n ) S n = 1 4 4 n 2 ( n + 1 ) = n + 1 2 ( n + 2 ) \begin{aligned} S_{n+1} & = S_n + r_{n+1} = S_n + \frac 1{4(1-S_n)} - S_n = \frac 1{4-\frac {4n}{2(n+1)}} = \frac {n+1}{2(n+2)} \end{aligned}

The claim is true for n + 1 n+1 and hence true for all n 1 n\ge 1 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...