1998 OIM Problems/Problem 5

Problem

Find the maximum possible value of $n$ so that there are distinct points $P_1, P_2, P_3, \cdots , P_n$ in the plane and real numbers $r_1, r_2, \cdots , r_n$ such that the distance between any two different points $P_i$ and $P_j$ be $r_i + r_j$ .

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

Page

Toolbox

Search

1998 OIM Problems/Problem 5

Problem

Solution

See also