oblomov

joined 2 years ago
[–] oblomov@sociale.network 1 points 1 week ago

@jon@vivaldi.net I was a long-time Opera aficionado, only dropped it when they switched to WebKit (and then Blink) and the last Presto-based version became obsolete (TLS-wise, mostly). Switched to Firefox, with which I'll stick as long as it maintains Gecko. Would love to jump to Vivaldi, but we need more independent rendering engines for the health of the web.

[–] oblomov@sociale.network 1 points 2 months ago (9 children)

@rglullis @Rooki (OT: the last paragraph in the post has a couple of typos. I believe it should be TINSTAAFL (also I recommend making it an abbr for the less informed), and there is an “under” that should probably be “understand”)

[–] oblomov@sociale.network 1 points 5 months ago

@HipsterTenZero @chloyster

I only just found this but, in case you're still testing things, here's a couple of hints:

  1. it is possible to navigate in the dark;
  2. it is possible to climb even without stairs, so you can usually get out of subterranean pits even tool-less; it's extremely rare to get into an actual “save-ender” situation
  3. as your tech level progresses, you'll discover ways to automate most things;
  4. do focus on getting ore; there are hints in the rock to where it may be.
[–] oblomov@sociale.network 1 points 7 months ago

@TootSweet this reminds me of https://github.com/philipl/pifs, the filesystem based on the normality of π

[–] oblomov@sociale.network 1 points 7 months ago (1 children)

@mrdk @mathematics @math@lemmy.ml @math@kbin.social also this might explain why @mau saw some relation to Gray codes in the binary case.

[–] oblomov@sociale.network 1 points 7 months ago (2 children)

@mrdk @mathematics @math@lemmy.ml @math@kbin.social
oh, interesting. It's definitely related, although we allow different substrings to start at the same place, and this has a huge impact on the lengths (also it's not cyclic in our case, but that probably makes things worse).

 

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?

http://wok.oblomov.eu/mathesis/number-substrings/

@mathematics @math@lemmy.ml @math@kbin.social

e.g. for a target of 19 a candidate representative would be 1011213141516171819 in base 10, that has 19 digits. Can it be done in less, or is $\sigma_10(19) = 19$?
Can we find a general rule? Any properties of this function?

#math #maths #numberTheory #combinatorics

[–] oblomov@sociale.network 1 points 7 months ago

@SuperSynthia @dvdnet62 I'll explain in two very simple words.

MOAR MONIES

[–] oblomov@sociale.network 1 points 1 year ago

@ernest I love that these messages basically mean «argh, we're drowning in our success!»
Thank you for all your work