/sci/ - Science & Math

>>10105816
>but no one has proved that the optimal string can’t contain repeats.
I don't think it can. I'm bruteforcing n=4 now for shit and giggles, and so far I see one clear pattern: for 34 you list all combinations, for 33 you list all but one combination. If you exclude more than one combination, you will not get anything. Since n=4 was bruteforced many times by various methods with various algorithms and machine assistance, there's little doubt about it.
For n=5 there should be excluded 9 combinations to get 153 numbers.