Erdős problem 1186 · problems.science

What is the minimum asymptotic density $\delta_k$ of monochromatic $k$ -term arithmetic progressions in every two-colouring of $\{1, \dots, n\}$ ? The exact certificate gives $\delta_3 = 117/2192$ , matching the known 548-bead colouring.

Workspace

Continue locally Open source Sign in to contribute

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview

Source#1186
→
ResultNone
→
Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

argument
VibeMathed
Machine
GPT-5.6 Star Fleet (Claude Fable 5 referee)
Reported outcome
partial
Open the source record

Reported activity

Search problems.science