A finite number of points are plotted so that the distances between any two are distinct. Each point joins the one closest to it. Find the maximum number of segments that can start from a single point.
Problem
Source:
Tags: geometry, combinatorics
31.01.2021 22:25
Yes îs good !I solve it but is so long to post it
01.02.2021 23:29
grazie so you confirm my solution?
02.02.2021 00:11
Yes is good
02.02.2021 17:09
where did you find this problem?
03.02.2021 00:58
I don't know i give This with a friend
07.02.2021 05:06
aha I think it's related with equilateral triangles it's 6 because 360/60=6
07.02.2021 05:21
07.02.2021 07:38
This was a question from IGMO (Instagram Maths Olympiad)
10.02.2021 20:08
rethinkink about it I rekon the solution is actually 5, because... points are plotted so that the distances between any two are distinct... So we can't have a regular exagon, can we?
11.02.2021 06:33
This is a nice problem! The answer is 5. A construction basically takes a regular pentagon and its center, but moves the points ever-so-slightly such that the distances are unique. We can easily verify that this works. Now we will show that 6 is impossible. Suppose that 6 segments are connected to a point $P$, one of the angles formed by two adjacent segments must be $\leq 60^\circ$ (since the minimum value must be less than the average, which is $60^\circ$). Call this angle $\theta$, and let the segments be $AP$ and $BP$. Also let $AP=a,BP=b,a<b$. Let $c$ be the length of $AB$. Then from Law of Cosines we have: $$c^2=a^2+b^2-2ab \cos \theta$$Since $\theta \leq 60^\circ$, this means that $\cos \theta \geq \frac{1}{2}$, so we have: $$c^2 \leq a^2+b^2-ab$$Since $a<b$, we have $a^2-ab<0$. This means that: $$c^2 \leq a^2+b^2-ab < b^2$$But then the segment $BP$ is not the shortest one which can be drawn from $B$, since $BA$ is shorter. Thus we have a contradiction, so 6 cannot be achieved.