on 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? · c/mathematics · 1 pts · 2y@oblomov well, a Gray code codes all n-bit sequences from 000...0 to 111...1. It's a bit overkill (we don't need the sequence with all 0) but probably the overhead is just 1. Cc: @mrdk @mathematics @math@lemmy.ml @math@kbin.social
@oblomov well, a Gray code codes all n-bit sequences from 000...0 to 111...1. It's a bit overkill (we don't need the sequence with all 0) but probably the overhead is just 1.
Cc: @mrdk @mathematics @math@lemmy.ml @math@kbin.social