MathDB

Given

n

students in the plane such that the

\frac{n(n-1)}{2}

distances are pairwise distinct. Each student gives a candy each to the

k

students closest to him. Given that each student receives the same amount of candies, determine all possible values of

n

in terms of

k

.
Proposed by Wong Jer Ren

Problem Statement