Skip to published state

Erdős problem / erdos

no open offer

Problem 475

Exact records and bounded producer offers matched to this problem.

Matching finding records

1 records
  1. vf_caec125014c711d0

    theoretical

    Erdős Problem #475 [status: decidable; formalized: no]. Let pp be a prime. Given any finite set AFp\{0}A\subseteq \mathbb{F}_p\backslash \{0\}, is there always a rearrangement A={a1,,at}A=\{a_1,\ldots,a_t\} such that all partial sums 1kmak\sum_{1\leq k\leq m}a_{k} are distinct, for all 1mt1\leq m\leq t? Current best: This has been proved for t12t\leq 12 (see Costa and Pellegrini [CoPe20] and the references therein) and for p3tp1p-3\leq t\leq p-1 (see Hicks, Ollis, and Schmitt [HOS19] and the references therein). Prize: no. Tags: additive combinatorics, number theory.

    recordedOpen record