• 0 Posts
  • 133 Comments
Joined 3 years ago
cake
Cake day: June 30th, 2023

help-circle

  • SnazztoMinecraftIs the default launcher terrible?
    link
    fedilink
    English
    arrow-up
    2
    ·
    14 days ago

    Yes you can but it’s kind of hidden.

    In Prism, it’s super easy to set up an instance, throw in a mod loader, and filter, download, and update compatible mods in the app. It also allows you to choose and configure the Java version easily per instance, view logs, and export instances.

    It also has the cat button, which shows a cat :3


  • Snazztomemes123 + 456 = 123456
    link
    fedilink
    arrow-up
    6
    ·
    20 days ago

    Base-n is a numeral positioning system where the value of each digit is n times the value of the dight directly to its right.

    We typically don’t let the maximum digit we use to be greater than or equal to n because then there would be multiple ways to express the same number.

    However when working with weird bases, sometimes it’s useful to forgo this convention.


  • Disregarding whether it would really be you…

    Would you trust the company that made the teleporter with the blueprints of your body?

    This whole trolly situation is suspicious. Seems like a setup by big teleport to build their clone army.

    Don’t believe me? Take a closer look at the people on the rail… each of them are the same person!



  • Very cool!

    I suspect that the minecart issue could also be solved by launching the cart upwards through the portal with a slime block. Then on the end side, use a rail on top of scaffolding 3 blocks above the obsidian platform to catch it.

    Scaffold has no bottom collision, so the cart can fly upwards through it and land on the rail.


  • SnazztoMildly Infuriating*Permanently Deleted*
    link
    fedilink
    English
    arrow-up
    6
    ·
    28 days ago

    What I would have done is started filling in letters randomly and every time a C or W ends up next to an O, choose the same letter or an O to put on the opposite side of the O.

    Its hard to prove, but I’m pretty sure there isn’t a situation where a space can’t be filled in with this algorithm.













  • It’s theoretically impossible to create a system to remember every human that doesn’t rely on external storage.

    I’ll explain: let’s say that for every human that dies, they will be remembered and live on in the heart of another, living human. Each living human can remember n dead humans.

    we can set up an equation

    pn >= r

    where p is the current population of live humans, r is the amount of dead humans that must be remembered.

    We can express the rate of deaths as a proportion of the current living population:

    d/dt[r] = pb

    Where t is time and b is the instantaneous death rate per captia with respect to time (generally a constant).

    Combined with the previous, we get the separable differential equation:

    d/dt[r] = pb >= (r/n)b

    dr/dt >= rb/n

    [1/r] rt >= [b/n] dt

    Integrated:

    ln|r| >= tb/n+C

    r >= e^(tb/n+C)

    pn >= r >= e^(tb/n+C)

    p >= e^(tb/n+C)/n

    So in order for this system to work, the living population must always be growing exponentially, which is not feasible for modern humanity.