Skip to content

Erdős problem 498

Let z1,…,zn∈Cz_1,\ldots,z_n\in\mathbb{C} with 1≤∣zi∣1\leq \lvert z_i\rvert for 1≤i≤n1\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 (n⌊n/2⌋)\binom{n}{\lfloor n/2\rfloor}?

Erdős Problems records this as proved (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. Resolutionproved (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 it124 share a topic
None carries a Standing. Browse the topic.