Erdős Problem #26
The question as posed was implicit in Davenport–Erdős (1951); the AI result settles Tenenbaum's open variant negatively
number-theory / Number Theory, Divisors
Let $A\subset\mathbb{N}$ be infinite. Must there exist some $k\geq 1$ such that almost all integers have a divisor of the form $a+k$ for some $a\in A$? The question as posed follows negatively from Davenport–Erdős (1951). The AI result settles Tenenbaum's harder variant, also negatively: there is an infinite $A$ such that for every $k\geq 1$ the set of multiples of $A+k$ has upper density below $0.34$.
Temporal state
No reconciled state yet.
Append-only history
The question as posed was implicit in Davenport–Erdős (1951); the AI result settles Tenenbaum's open variant negatively
Research memory
Let $A\subset\mathbb{N}$ be infinite. Must there exist some $k\geq 1$ such that almost all integers have a divisor of the form $a+k$ for some $a\in A$? The question as posed follows negatively from Davenport–Erdős (1951). The AI result settles Tenenbaum's harder variant, also negatively: there is an infinite $A$ such that for every $k\geq 1$ the set of multiples of $A+k$ has upper density below $0.34$.
The question as posed was implicit in Davenport–Erdős (1951); the AI result settles Tenenbaum's open variant negatively
Evidence graph
No public relationships recorded yet.