.mau. :friendfeed: @frenfiverse.net matematto divagatore ascendente wikipedia. Un rompipalle.
Posts 2
Comments 1
prova2
prova2
Poi cancello il post, ma devo capire se @test riceve
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?
@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 @[email protected] @[email protected]