Paragraph
let $$M = \left\{(x, y) \epsilon R \times R โถ x^{2} + y^{2} \leq r^{2} \right\}$$
where r > 0. Consder the geometric progression $$a_{n} = \frac{1}{2^{n-1}}, n = 1, 2, 3, ...$$ Let $$S_{0}=0$$ and, for $$n \geq 1$$, let $$S_{n}$$ denote the sume of the first n terms of this progression . For $$n \geq 1$$, Let$$C_{n}$$ denote the circle with center $$\left(S_{n-1},S_{n-1}\right)$$ and radius $$a_{n}$$.
Consider M with $$r = \frac{1025}{513}$$. Let k be the number of all those circle $$C_{n}$$ that are inside M. Let l be the maximum posible number of circle among these k circle such that no two circle intersect. Then
Create a FREE account and get: