What is the conjecture
https://www.erdosproblems.com/538
Let $r\geq 2$ and suppose that $A\subseteq\{1,\ldots,N\}$ is such that, for any $m$, there are at most $r$ solutions to $m=pa$ where $p$ is prime and $a\in A$. Give the best possible upper bound for
$$\sum_{n\in A}\frac{1}{n}.$$
Status: open
Choose either option
What is the conjecture
https://www.erdosproblems.com/538
Let$r\geq 2$ and suppose that $A\subseteq\{1,\ldots,N\}$ is such that, for any $m$ , there are at most $r$ solutions to $m=pa$ where $p$ is prime and $a\in A$ . Give the best possible upper bound for
$$\sum_{n\in A}\frac{1}{n}.$$
Status: open
Choose either option