Erdős Problem 784
This issue describes Erdős Problem 784, which asks whether a subset A of {1,...,n} with a bounded sum of reciprocals (sum(1/a for a in A) <= C) guarantees the existence of a constant c such that the count of numbers <= n not divisible by any element of A is at least n/(log n)^c. The problem is marked as solved and is up for grabs.