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.
Impeccable demonstration
Problem Loading...
Note Loading...
Set Loading...
Descartes' circle theorem gives a nice recursion for the radius of circle R n + 1 squeezed between two larger circles, R n and R n − 1 as
R n 1 = R n − 1 1 + R n − 2 1 + R n − 1 R n − 2 2 , n ≥ 3 with R 1 = 4 , R 2 = 1 .
We observe the first six values of R n using the recursion above
Since the numbers in the denominator seem to be squares of 1 , 2 , 3 , 5 , 8 , 1 3 respectively, we make the following claim:
R n = F n + 1 2 4 where F n denotes the n t h Fibonacci number.
We prove this by strong induction. The base case is already taken care of as shown above. We now assume the above holds true ∀ i ∈ N : i ≤ k . We now prove that k + 1 case holds true.
To prove this, we use the recursion obtained at the beginning to get
R k + 1 1 = R k 1 + R k − 1 1 + R k R k − 1 2 = 4 F k + 1 2 + 4 F k 2 + 2 F k F k + 1 = ( 2 F k + 2 F k + 1 ) 2 = 4 F k + 2 2
thus the induction holds ∀ n ∈ N and the formula holds true.
Hence,
n → ∞ lim R n + 1 R n = n → ∞ lim F n + 1 F n + 2 = φ
Thus,
( n → ∞ lim R n + 1 R n − n → ∞ lim R n R n + 1 ) 2 / 3 = ( φ − φ 1 ) 2 / 3 = 1 2 / 3 = 1