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}?

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:134512f9fbb57a5fe4effc90b6df239370f1519622c42eb6bbcda1299f64e19b
Metadata
sha256:62d5e8d5c9bb989a06bda040a8a68eeffea946ba91729963936140add18fdc0e
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:b6ece053e090c42dd0f14182bc3c98788e05875a8a9c57a76ebc42a13a24f911
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page