Dual View Random Solved Random Open
OPEN This is open, and cannot be resolved with a finite computation.
Given $A\subseteq \mathbb{N}$ let $M_A=\{ n \geq 1 : a\mid n\textrm{ for some }a\in A\}$ be the set of multiples of $A$. Find a necessary and sufficient condition on $A$ for $M_A$ to have density $1$.
Disclaimer: The open status of this problem reflects the current belief of the owner of this website. There may be literature on this problem that I am unaware of, which may partially or completely solve the stated problem. Please do your own literature search before expending significant effort on solving this problem. If you find any relevant literature not mentioned here, please add this in a comment.
A sequence $A$ for which $M_A$ has density $1$ is called a Behrend sequence.

If $A$ is a set of prime numbers (or, more generally, a set of pairwise coprime integers without $1$) then a necessary and sufficient condition is that $\sum_{p\in A}\frac{1}{p}=\infty$.

The general situation is more complicated. For example suppose $A$ is the union of $(n_k,(1+\eta_k)n_k)\cap \mathbb{Z}$ where $1\leq n_1<n_2<\cdots$ is a lacunary sequence. (This construction is sometimes called a block sequence.) If $\sum \eta_k<\infty$ then the density of $M_A$ exists and is $<1$. If $\eta_k=1/k$, so $\sum \eta_k=\infty$, then the density exists and is $<1$.

Erdős writes it 'seems certain' that there is some threshold $\alpha\in (0,1)$ such that, if $\eta_k=k^{-\beta}$, then the density of $M_A$ is $1$ if $\beta <\alpha$ and the density is $<1$ if $\beta >\alpha$.

Tenenbaum notes in [Te96] that this is certainly not true as written since if the $n_j$ grow sufficiently quickly then this sequence is never Behrend, for any choice of $\eta_k$. He then writes 'we understand from subsequent discussions with Erdős that he had actually in mind a two-sided condition on' $n_{j+1}/n_j$.

Tenenbaum [Te96] proves this conjecture: if there are constants $1<C_1<C_2$ such that $C_1<n_{i+1}/n_i<C_2$ for all $i$ and $\eta_k=k^{-\beta}$ then $A$ is Behrend if $\beta<\log 2$ and not Behrend if $\beta>\log 2$.

View the LaTeX source

This page was last edited 28 December 2025.

External data from the database - you can help update this
Formalised statement? No (Create a formalisation here)
Likes this problem Alfaiz
Interested in collaborating None
Currently working on this problem None
This problem looks difficult None
This problem looks tractable None

Additional thanks to: Alfaiz and Desmond Weisenberg

When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:

T. F. Bloom, Erdős Problem #691, https://www.erdosproblems.com/691, accessed 2026-01-16