Let $$M = \{ (x,y) \in R \times R:{x^2} + {y^2} \le {r^2}\}$$, where r > 0. Consider the geometric progression ${a_n} = {1 \over {{2^{n - 1}}}}$, n = 1, 2, 3, ...... . Let S0 = 0 and for n $\ge$ 1, let Sn denote the sum of the first n terms of this progression. For n $\ge$ 1, let Cn denote the circle with center (Sn $-$ 1, 0) and radius an, and Dn denote the circle with center (Sn $-$ 1, Sn $-$ 1) and radius an.Consider M with $r = {{1025} \over {513}}$. Let k be the number of all those circles Cn that are inside M. Let l be the maximum possible number of circles among these k circles such that no two circles intersect. Then