The frontier
For each problem and parameter: the best published value with its source, our best verified value, and where we stand. Sort any column.
Largest sets with no arithmetic progression (Erdős #142)
How large can a set of whole numbers up to N be if no k of them form an arithmetic progression? Exact answers are published only for small N. Past that, a bigger verified set is a new lower bound, and the table shows how close we are to finding one.
Published values checked on 2026-11-21. Past the exact range we found no published table of best lower bounds for k = 4, 5 and 6. This is a search of OEIS, erdosproblems.com and the literature on 2026-11-21, not proof that none exists; an expert review is how a candidate is checked against it. Where no published value exists, the table shows the best set known without any contributor result: the larger of simple known constructions (base-b digit sets, found by scripts/apfree_constructions.py) and the exact OEIS data extended by search, with the construction named.
| Case | k | N | Published or known best | Our best verified | Starting point (ours) | Status | Attempts | Improvements | Last attempt |
|---|---|---|---|---|---|---|---|---|---|
| Erdős #142, no 4-term progression, N = 142 | 4 | 142 | 58 source | none yet | 58 | Matches the published value | 0 | 0 | none yet |
| Erdős #142, no 4-term progression, N = 150 | 4 | 150 | 58 the signed seed set (Cariboni's exact data extended by a local search) | none yet | 58 | No published value found | 3 | 0 | 2026-11-21 |
| Erdős #142, no 4-term progression, N = 677 | 4 | 677 | 174 numbers whose base-11 digits are all in {0,1,3,4,5,9} after subtracting 1 | 171 (below the known 174) | 174 | Below a known construction | 1 | 0 | 2026-11-21 |
| Erdős #142, no 5-term progression, N = 115 | 5 | 115 | 67 source | none yet | 67 | Matches the published value | 0 | 0 | none yet |
| Erdős #142, no 5-term progression, N = 120 | 5 | 120 | 68 the signed seed set (Cariboni's exact data extended by a local search) | none yet | 68 | No published value found | 3 | 0 | 2026-11-21 |
| Erdős #142, no 5-term progression, N = 677 | 5 | 677 | 307 a plain CPU local search with no model (audit, 2026-11-21) | 295 | n/a | Below a known construction | 1 | 0 | 2026-11-21 |
| Erdős #142, no 6-term progression, N = 147 | 6 | 147 | 95 source | none yet | 95 | Matches the published value | 0 | 0 | none yet |
| Erdős #142, no 6-term progression, N = 420 | 6 | 420 | 232 a plain CPU local search with no model (audit, 2026-11-21) | 227 | n/a | Below a known construction | 1 | 0 | 2026-11-21 |
What the statuses mean
- Below a known construction
- A contributor set was verified but is not larger than a set that a simple known construction gives, so it is not a candidate improvement.
- Matches the published value
- Our starting point is the same size as the published exact value (no contributor set is needed to match it).
- Below the published value
- Our best (verified or starting point) is smaller than the published value.
- Improved, awaiting expert review
- A verified set is larger than the best set we knew. A literature check and an expert have not reviewed it yet, so it is not a discovery.
- Improved, reviewed by an expert
- A named expert reviewed it and confirmed it beats the published value.
- No published value found
- We found no published value to compare with. Our best is a lower bound we hold (a starting point or a verified set), not a claim about the literature.
- Published value only
- Only the published value is listed; we have not computed our own.
Downloads: frontier.csv, markdown, JSON (tiers.frontier). Our best verified is a set a contributor submitted that passed the verifier. The starting point (ours) is the bar SpareTokens signed into its tasks, computed by the coordinator; it is not a contributor result. Neither is a claim about the literature.
Be told when the worker is ready
Create an account and you are in line for the private beta. We email you when it is your turn.