Skip to content

Erdős problem 328

Suppose A⊆NA\subseteq\mathbb{N} and C>0C>0 is such that 1A∗1A(n)≤C1_A\ast 1_A(n)\leq C for all n∈Nn\in\mathbb{N}. Can AA be partitioned into tt many subsets A1,…,AtA_1,\ldots,A_t (where t=t(C)t=t(C) depends only on CC) such that 1Ai∗1Ai(n)<C1_{A_i}\ast 1_{A_i}(n)<C for all 1≤i≤t1\leq i\leq t and n∈Nn\in \mathbb{N}?

Erdős Problems records this as disproved (Lean).

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal1 retained
  4. Resolutiondisproved (Lean)
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Where the source files it639 share a topic
Erdős problem 321accepted
Carrying a Standing. Browse the topic.