Skip to content

Erdős problem 26

Let ANA\subset\mathbb{N} be infinite. Must there exist some k1k\geq 1 such that almost all integers have a divisor of the form a+ka+k for some aAa\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 AA such that for every k1k\geq 1 the set of multiples of A+kA+k has upper density below 0.340.34.

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:f6b8ebc7cc437e125cb703f55148858dd1b5825da5ad06f49ca6bfc85c13bb35
Metadata
sha256:084f6a22c21d64d7b30eb9429a7299f61b037f2141ae98da7d58c2df23f32e94
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:f7cd51709a2e21c333269085405df775c2888997f3ed9dcd7417a764de500b74
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page