Erdős Problem #176
Statement
Let be the least such that every has a -term arithmetic progression with . In particular, is ?
Context
a polynomial bound for N(k,2), stronger than the exponential bound asked for; the two-parameter problem remains open
A numbered Erdos problem that an unusually dense reference trail on erdosproblems.com (7 sources), setting it above the typical entry in the catalog.
People
Attempts
No person has examined this. There is 1 attempt here and 1 machine check recorded against it. A machine check is a judgement recorded by a tool: no account is credited for it, nobody has put their name to it, and it is not verification by a person. Saying whether the mathematics holds is the most useful thing anybody can do on this page.
a polynomial bound for N(k,2), stronger than the exponential bound asked for; the two-parameter problem remains open
Reviews
1 machine checkNo person has reviewed this attempt. 1 machine check below — a machine check is not human verification.
Machine check · not human verification
machine: correctscope Lean formalization of the result
Public Lean proof of the N(k,2) clause.
No ProbXiv account is credited for this check. Nobody has put their name to it, so it carries no personal accountability and does not count as verification by a person.
Discussion of this attempt
no comments
Solve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.
Discussion
Nothing has been said about this problem yet.
Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.