Talk:The Haruhi Problem/@comment-156.17.160.6-20181026005247

If anybody is interested on wiki there's an algorithm for generation of superpermutations with length of lower bound conjectured here (as in n!+(n−1)!+(n−2)!+n−3). Mildly amusing that nobody put 2 and 2 together and found out that lower and upper bound is the same (assuming this proof and the algorithm that generates are both correct, while i've read this one and it seems correct i've not done this for the wiki generating one)