Superpermutation Almanac

Bounds

Exhaustive search

S(5) ≥ 153

Holds for
n = 5
Announced
Aug 13, 2014
Proof
Computer check

By Ben Chaffin.

Evidence

  • Computer check arxiv.org/abs/1408.5108 Houston's arXiv paper (2014-08-21) reports that Concorde solved the five-symbol instance exactly, 'confirming Chaffin's recent result'; an independent computer check