/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/modulepublicimportFormalConjecturesUtil
Ben Green's Open Problem 37
What is the smallest subset of ℕ containing, for each d = 1, …, N,
an arithmetic progression of length k with common difference d?
Given a natural number N, what is the smallest size of a subset of ℕ that contains, for each d = 1, …, N,
an arithmetic progression of length k with common difference d.
Asymptotic version: determine the asymptotic behavior of m(N, k) as N grows.
The solver should determine a function f : ℕ → ℕ → ℝ such that, for each k,
f k eventually equals (fun N ↦ (m N k : ℝ)).
The interval {0, …, kN} contains, for each d = 1, …, N, the arithmetic progression
{0, d, …, (k - 1)d}, so m(N, k) ≤ kN + 1.
All goals completed! 🐙·refine_3N:ℕk:ℕd:ℕhd:1≤d∧d≤N⊢ ↑(Finset.image(funi↦i*d)(Finset.rangek))={x|∃n,∃(_:↑n<↑k),0+n•d=x}extxrefine_3N:ℕk:ℕd:ℕhd:1≤d∧d≤Nx:ℕ⊢ x∈↑(Finset.image(funi↦i*d)(Finset.rangek))↔x∈{x|∃n,∃(_:↑n<↑k),0+n•d=x};simpAll goals completed! 🐙
Writing F_k(N) for m(N, k), Green conjectures that F_k(N) ≫_k N^(1 - c_k) for some
sequence c_k with c_k → 0 as k → ∞.
The restriction to 0 < k excludes the degenerate case m(N, 0) = 0.