Let d⋆=sup{d∣d is good }. We will show that d⋆=ln(2)≐0.693. 1. d⋆≤ln2: Assume that some d is good and let a1,a2,… be the witness sequence. Fix an integer n. By assumption, the prefix a1,…,an of the sequence splits the interval [0,d] into n+1 parts, each of length at most 1/n. Let 0≤ℓ1≤ℓ2≤⋯≤ℓn+1 be the lengths of these parts. Now for each k=1,…,n after placing the next k terms an+1,…,an+k, at least n+1−k of these initial parts remain intact. Hence ℓn+1−k≤n+k1. Hence d=ℓ1+⋯+ℓn+1≤n1+n+11+⋯+2n1(2) As n→∞, the RHS tends to ln(2) showing that d≤ln(2). Hence d⋆≤ln2 as desired. 2. d⋆≥ln2 : Observe that ln2=ln2n−lnn=i=1∑nln(n+i)−ln(n+i−1)=i=1∑nln(1+n+i−11) Interpreting the summands as lengths, we think of the sum as the lengths of a partition of the segment [0,ln2] in n parts. Moreover, the maximal length of the parts is ln(1+1/n)<1/n. Changing n to n+1 in the sum keeps the values of the sum, removes the summand ln(1+1/n), and adds two summands ln(1+2n1)+ln(1+2n+11)=ln(1+n1) This transformation may be realized by adding one partition point in the segment of length ln(1+1/n). In total, we obtain a scheme to add partition points one by one, all the time keeping the assumption that once we have n−1 partition points and n partition segments, all the partition segments are smaller than 1/n. The first terms of the constructed sequence will be a1=ln23,a2=ln45,a3=ln47,a4=ln89,….