Skip to content

Erdős problem 34

Start work

For any permutation π∈Sn\pi\in S_n of {1,…,n}\{1,\ldots,n\} let S(π)S(\pi) count the number of distinct consecutive sums, that is, sums of the shape ∑u≤i≤vπ(i)\sum_{u\leq i\leq v}\pi(i). Is it true that S(π)=o(n2) S(\pi) = o(n^2) for all π∈Sn\pi\in S_n?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands 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:1dcfa1df0ff315dd2cac45f826e54b97a10226293c4c0b445b36039e1faf2dac
Metadata
sha256:c0e52414be5fd461b796740b7bfa82e32582620794cf08330801be1ca87e5486
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:7aacc8969431288c3d8efafb0c61484b92afa468cd4f514b74c01e95351f8b4f
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON