[Reincarnate]

Originally Posted by stargroup100

dude rubix just use my conjectures

they're pretty much correct

here I'll even repost them again

1. A term in a maximal sum subset can never have more than two unique prime factors.
2. When optimizing the sum of a subset by choosing to multiply two powers of primes, the two primes are never both below sqrt(n).
3. For high values of n, no term in a maximal sum subset can be composed of only a single prime factor below sqrt(n) raised to a power, except for values close to sqrt(n).

I'm aware of all these -- it doesn't address the problem I'm having unfortunately