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?

Erdős Problems records this as disproved (Lean).

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal1 retained
  4. Resolutiondisproved (Lean)
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Open the work surface
Where the source files it575 share a topic
Number Theory576
Erdős problem 321accepted
Carrying a Standing. Browse the topic.
Start workOpen sources