Find all integers $n \geq 3$ with the following property: there exist $n$ distinct points on the plane such that each point is the circumcentre of a triangle formed by 3 of the points.
Problem
Source: CHKMO 2018 P4
Tags: combinatorial geometry, geometry, circumcircle
13.05.2020 12:17
please somebody give a hint that is so hard
13.05.2020 21:33
where can I find official solution???
14.05.2020 18:44
Anyone know a solution for this?
14.05.2020 19:18
people from hong kong should know the answer
14.05.2020 20:22
First of all we will discuss the case when $n \ge 7$ It is easy to prove that a regular hexagon $A_1A_2A_3A_4A_5A_6$ and its centre $O$ form a good configuration. For $n \in \{8,9,10,11,12,13\}$ just add to our initial configuration points $O_i$ , circumcenters of $\bigtriangleup OA_iA_{i+1}$. For example, if $n =11$ we add $O_1, O_2, O_3, O_4$ . Then a straightforward induction shows that for each $n \ge 7$ there exist a good configuration : If $n = 7k +r $ with $ 0\le r \le 6$ consider $k-1$ disjoint hexagons with their centre and another one adding their $O_1, O_2\cdots O_r$. Now we rule out the cases $n \in \{3,4,5,6\}$
07.02.2021 19:15
Can anyone solve this problem, it's so hard
16.09.2024 04:21
Bump! Has anyone found the construction for $n=6$?