MathDB
Problems
Contests
National and Regional Contests
Malaysia Contests
JOM Shortlists
JOM 2015 Shortlist
C4
C4
Part of
JOM 2015 Shortlist
Problems
(1)
Coloring on a plane
Source: Junior Olympiad of Malaysia Shortlist 2015 C4
7/17/2015
Nikees has a set
S
S
S
of
n
n
n
points on a plane and decides to colour them. All
(
n
2
)
\dbinom{n}{2}
(
2
n
ā
)
line segments are drawn and they have distinct lengths. Find the maximum number of colours that are used at least once, given that:(a) For each point
P
P
P
, the two endpoints of the longest line segment connecting
P
P
P
must be of the same colour. (b) For each point
P
P
P
, the two endpoints of the shortest line segment connecting
P
P
P
must be of the same colour.
combinatorics