Skip to content

Erdős problem 973

Does there exist a constant C>1C>1 such that, for every n2n\geq 2, there exists a sequence ziCz_i\in \mathbb{C} with z1=1z_1=1 and zi1\lvert z_i\rvert \geq 1 for all 1in1\leq i\leq n with max2kn+11inzik<Cn\max_{2\leq k\leq n+1}\left\lvert \sum_{1\leq i\leq n}z_i^k\right\rvert < C^{-n}?

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:997ae9db6f225e66948bcdbe1f6d049e5dc87c77a6fc5074744f77ce90e3d86a
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page