Quote:
Originally Posted by rudy235
Disclosure: i must say do not like the heading too much but that is the actual title of the Article in Quanta magazine with yesterday’s date by Jordana Cepelewicz.
<snip>

I agree,
Quanta booted the title. A more accurate title appears to be
A proof of the Erdős primitive set conjecture (Arxiv preprint).
I found a description of the conjecture online:
Quote:
A subset of the integers larger than 1 is primitive if no member divides another. Erdős proved in 1935 that for a running over a primitive set A is universally bounded over all choices for A. In 1988 he asked if this universal bound is attained for the set of prime numbers.
