mrdk

joined 2 years ago
sorted by: new top controversial old
A curious math problem I came up with: given a target, what's the fewest digits an integer must have (in a given base) to contain all integers from 0 to the target, as substrings? in c/[email protected]
[–] [email protected] 4 points 6 months ago* (last edited 6 months ago) (3 children)

@oblomov @mathematics @[email protected] @[email protected] No solution, but the problem is related to de Bruijn sequences (https://en.wikipedia.org/wiki/De_Bruijn_sequence), for which there exists a lot of literature.