Paragraph
Let
where . Consider the geometric progression , . Let and, for , let denote the sum of the first terms of this progression. For , let denote the circle with center and radius , and denote the circle with center and radius .
Passage
Paragraph
Let
where . Consider the geometric progression , . Let and, for , let denote the sum of the first terms of this progression. For , let denote the circle with center and radius , and denote the circle with center and radius .
Consider with . Let be the number of all those circles that are inside . Let be the maximum possible number of circles among these circles such that no two circles intersect. Then
Official answer: D
Which lie inside M. is inside when . Now , and . So we need , i.e. : .
Which circles intersect.
So the most non-intersecting circles is every other one: .
Check the options. . (D)