# Recovering a partition of 50

The sum of 10 numbers, not necessarily distinct, is 50. When placed appropriately in the circles of this diagram, any two numbers will be joined by a line if, and only if, they have a common divisor greater than 1.

What are those ten numbers?

How many other partitions of 50 (or, in general, of N) can be uniquely recovered from its corresponding graph of common divisors, that is, the simple graph whose vertex set is the set of parts, two of of which are joined by an edge if, and only if, they have a common factor greater than 1?

• An immediate observation is that the lone vertex must be odd. If it were even, then no other vertex woud be even, so we'd have $9$ odd numbers and a single even number, the sum of which must be odd (and $50$ is even). – Fimpellizieri May 8 '17 at 4:59
• @Fimpellizieri How do you know that if the lone vertex were even, the rest are not even? – Arby May 8 '17 at 5:05
• @Arby: Because any even number would share a common factor (namely, $2$) with that vertex and would then be connected by an edge. – Brian Tung May 8 '17 at 5:10
• OP: It might be worth pointing out that the numbers do not have to be distinct (in fact, in this case, cannot be distinct). – Brian Tung May 8 '17 at 5:12
• @BrianTung Thanks for being gentle with me in my senior moment. :) – Arby May 8 '17 at 5:20

Try a couple of random assignments of numbers to the graph that satisfy the graph structure. Observe that they tend to sum to greater than $50$. So your strategy should be to use numbers that are as small as possible, repeating the smallest numbers as many times as possible.
Hint 1: Start by determining the only place(s) where you can place a $1$.
Hint 2: In a sum of any $10$ numbers to $50$, there must be an even number of even numbers. Where can they go?
Hint 3: Now apportion the odd primes $3$, $5$, and $7$ greedily, placing the smaller primes in the larger groups. What result do you get?