Behrend's theorem

In arithmetic combinatorics, Behrend's theorem states that the subsets of the integers from 1 to ${\displaystyle n}$ in which no member of the set is a multiple of any other must have a logarithmic density that goes to zero as ${\displaystyle n}$ becomes large. The theorem is named after Felix Behrend, who published it in 1935.