Erdős problem 164

A set $A\subset \mathbb{N}$ is primitive if no member of $A$ divides another. Is the sum $$\sum_{n\in A}\frac{1}{n\log n}$$ maximised over all primitive sets when $A$ is the set of primes?