number-theory / Number Theory, Divisors

Erdős Problem #26

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$.

10Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

number-theoryApr 6, 2026Significance 10/100Registry: site confirmed

Erdős Problem #26

Prior state unknowndisproved

The question as posed was implicit in Davenport–Erdős (1951); the AI result settles Tenenbaum's open variant negatively

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

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

Recorded attempts

Evidence graph

Connected research record

No public relationships recorded yet.

Erdős Problem #26 — Mathematical Frontier Network