.mau. :friendfeed:

mau@frenfiverse.net

matematto divagatore ascendente wikipedia. Un rompipalle.

2 Posts
1 Comment

Joined 2 years ago

Cake day: November 22nd, 2022

You are not logged in. If you use a Fediverse account that is able to follow users, you can follow this user.

OverviewCommentsPosts

.mau. :friendfeed:@frenfiverse.net to

Test: palestra e allenamenti :-)@feddit.it · 5 months ago

prova3

0

2

prova3

.mau. :friendfeed:@frenfiverse.net to

Test: palestra e allenamenti :-)@feddit.it · 5 months ago

0

.mau. :friendfeed:@frenfiverse.net to

Test: palestra e allenamenti :-)@feddit.it · 5 months ago

prova2

1

1

prova2

.mau. :friendfeed:@frenfiverse.net to

Test: palestra e allenamenti :-)@feddit.it · 5 months ago

1

.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?
link
fedilink
arrow-up
1·
8 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 @[email protected] @[email protected]

link
fedilink