Problem

Source:

Tags: geometry, parallelogram, combinatorial geometry, combinatorics proposed, combinatorics



Let $A$ be a set consisting of 6 points in the plane. denoted $n(A)$ as the number of the unit circles which meet at least three points of $A$. Find the maximum of $n(A)$