Open Proof Network

Needs a steward / erdos-52

Steward erdos-52

Whether for every ε>0 a finite set of integers has either its sumset or its product set of size at least a constant times |A|^(2−ε).

The problem’s page →

What the role asks
  • Understand what the network proves on this problem.
  • Write it up, and sign the explainer of the proof that closes it.
  • Best efforts, no deadline: step down at any time.
Read more about stewards →