Claims

../

1986_03_01_hegyvari: Hegyvári's Theorem 1: (1/3 + o(1))n distinct integers in [1, n] with all consecutive sums distinct; heading a permutation, they give at least (1/18 + o(1))n^2 distinct consecutive sums, the first disproof of Problem 34.

2015_04_27_konieczny: Konieczny's Proposition 1.1: the permutation 1, n, 2, n-1, 3, n-2, ... has pairwise distinct consecutive sums of odd length, hence at least n^2/4 distinct consecutive sums, so S(pi) = o(n^2) fails, refuting Problem 34.

---