# A partition of 1000 into nine parts

The sum of nine whole numbers is 1000. If those numbers are placed on the vertices of this graph, two of them will be joined by an edge if and only if they have a common divisor greater than 1 (i.e. they are not relatively prime).

In non-decreasing order, what are those nine numbers?

• Having a common divisor greater than $1$ and being relatively prime are opposites. May 8, 2018 at 17:18
• @noedne: Sorry! Corrected. May 8, 2018 at 17:25

$5$, $6$, $11$, $19$, $51$, $91$, $221$, $266$, $330$ works:
5    11
221--91