Open-access mathematical research insights
About Contact
Home / Erdos Problems / Problem #973

Problem #973: Does there exist a constant $C>1$ such that, for every...

Does there exist a constant $C>1$ such that, for every $n\geq 2$, there exists a sequence $z_i\in \mathbb{C}$ with $z_1=1$ and $\lvert z_i\rvert \geq...

Problem Statement

Does there exist a constant $C>1$ such that, for every $n\geq 2$, there exists a sequence $z_i\in \mathbb{C}$ with $z_1=1$ and $\lvert z_i\rvert \geq 1$ for all $1\leq i\leq n$ with\[\max_{2\leq k\leq n+1}\left\lvert \sum_{1\leq i\leq n}z_i^k\right\rvert < C^{-n}?\]
Categories: Analysis

Progress

This is Problem 7.3 in [Ha74], where it is attributed to Erdős.

Erdős proved (as described on p.35 of [Tu84b]) that such a sequence does exist with $\lvert z_i\rvert\leq 1$. Indeed, Erdős' construction gives a value of $C\approx 1.32$.

In [Er92f] (a different) Erdős refines this analysis, proving that if\[M_2=\min_{z_j} \max_{2\leq k\leq n+1} \left\lvert \sum_{1\leq j\leq n}z_j^k\right\rvert,\]where the minimum is take over all $z_j\in \mathbb{C}$ with $\max \lvert z_j\rvert=1$, then\[(1.746)^{-n} < M_2 < (1.745)^{-n}.\]Tang notes in the comments that Theorem 6.1 of [Tu84b] implies that, if $\lvert z_i\rvert \geq 1$ for all $i$, then\[\max_{2\leq k\leq n+1}\left\lvert \sum_{1\leq i\leq n}z_i^k\right\rvert \geq (2e)^{-(1+o(1))n}.\]See also [519].

Source: erdosproblems.com/973 | Last verified: January 19, 2026

Stay Updated

Get weekly digests of new research insights delivered to your inbox.