Skip to content

Erdős problem 498

Let z1,,znCz_1,\ldots,z_n\in\mathbb{C} with 1zi1\leq \lvert z_i\rvert for 1in1\leq i\leq n. Let DD be an arbitrary disc of radius 11. Is it true that the number of sums of the shape i=1nϵizi for ϵi{1,1}\sum_{i=1}^n\epsilon_iz_i \textrm{ for }\epsilon_i\in \{-1,1\} which lie in DD is at most (nn/2)\binom{n}{\lfloor n/2\rfloor}?

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#498
  2. ResultNone
  3. Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

  • Formalization

    Erdős AI contributions wiki · Jan 27, 2026

    Machine
    Aristotle, Claude Opus, Gemini Flash, Gemini Pro
    Open the source record

Search problems.science

Find a Problem, Result, source, or page