Skip to content

Erdős problem 1193

Let A⊂NA\subset \mathbb{N} and let g(n)g(n) be a non-decreasing function of nn which is always >0>0.

Sources

The source's own material, retained exactly.

4 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

1193.lean

Retained formal statement1 of 4

Let A⊂NA\subset \mathbb{N} and let g(n)g(n) be a non-decreasing function of nn which is always >0>0.

Is the lower density of {n:1A∗1A(n)=g(n)}\{ n : 1_A\ast 1_A(n)=g(n)\} always 00?

The answer is trivially no to both questions: indeed if A=NA=\mathbb{N} (assuming 0∈N0\in\mathbb{N}) then 1A∗1A(n)=n+11_A\ast 1_A(n)=n+1 for all nn. Presumably Erdős had some additional restrictions on either gg or AA in mind, but these are not recorded in [Er80].

FormalConjectures/ErdosProblems/1193.leanErdos1193.erdos_1193.parts.i3 linesExact file
False ↔  ∀ (A : Set ℕ) (g : ℕ → ℕ),    Monotone g → (∀ (n : ℕ), 0 < g n) → {n | AdditiveCombinatorics.sumRep A n = g n}.lowerDensity = 0
SolvedStatement only, no proof