Skip to content

Erdős problem 973

Does there exist a constant C>1C>1 such that, for every n≥2n\geq 2, there exists a sequence zi∈Cz_i\in \mathbb{C} with z1=1z_1=1 and ∣zi∣≥1\lvert z_i\rvert \geq 1 for all 1≤i≤n1\leq i\leq n with max⁡2≤k≤n+1∣∑1≤i≤nzik∣<C−n\max_{2\leq k\leq n+1}\left\lvert \sum_{1\leq i\leq n}z_i^k\right\rvert < C^{-n}?

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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:85587de870feb78da954f7c54ee97074a55e3a4e4028f06b7b8e2f58861c4a73
Metadata
sha256:30b44b116a30f52c01260d5e4b2b252fbaaeea0cc2eb1be7536f6e52e81d9a70
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:997ae9db6f225e66948bcdbe1f6d049e5dc87c77a6fc5074744f77ce90e3d86a
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb