.mau. :friendfeed:@frenfiverse.net to Test: palestra e allenamenti :-)@feddit.it · 3 months agoprova3plus-squaremessage-squaremessage-square0fedilinkarrow-up12arrow-down10
arrow-up12arrow-down1message-squareprova3plus-square.mau. :friendfeed:@frenfiverse.net to Test: palestra e allenamenti :-)@feddit.it · 3 months agomessage-square0fedilink
.mau. :friendfeed:@frenfiverse.net to Test: palestra e allenamenti :-)@feddit.it · 3 months agoprova2plus-squaremessage-squaremessage-square1fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1message-squareprova2plus-square.mau. :friendfeed:@frenfiverse.net to Test: palestra e allenamenti :-)@feddit.it · 3 months agomessage-square1fedilink
minus-square.mau. :friendfeed:@frenfiverse.nettoMathematics@lemmy.ml•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?linkfedilinkarrow-up1·7 months ago@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 linkfedilink
@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