I model and doodle stuff

  • 39 Posts
  • 82 Comments
Joined 2 years ago
cake
Cake day: September 1st, 2023

help-circle






















  • Kaelygon@lemmy.worldtoScience Memes@mander.xyzI wanna ROCK
    link
    fedilink
    English
    arrow-up
    4
    ·
    edit-2
    10 months ago

    It’s condensed content with simpler terms and plain English, which is helpful for those who aren’t native speakers, like Gamba said.
    Simple wiki also comes in handy in topics like biology, which can have very specialized vocabulary.

    But in this context, the people who unironically believe in things like the moon not being a reflector can’t be reasoned with. They won’t change their mind no matter how simple English you explain the fact.




  • Google search results are often completely unrelated so it’s not any better. If the thing I’m looking for is obscure, AI often finds some thread that I can follow, but I always double check that information.
    Know your tool limits, after hundreds of prompts I’ve learned pretty well when the AI is spitting bullshit answers. Real people on the internet can be just as wrong and biased, so it’s best to find multiple independent sources



  • I loved every bit of Rain World! But I ended up quitting it mid play through when it became too hard. I found a way to gather stacks of berries to have enough reattempts for the hard parts, but then got lost where I was even supposed to go and gave up after ~25 hours playtime


  • Whoop, I mixed up dark souls 3 with Elden ring. Though, the same applies. I did like the gritty atmosphere and lore. The main issue I had was the learning curve and when trying to playing co-op there was no way to turn off strangers joining what I recall. But I bet by now there’s mods for all of that like you said.



  • It appears to always run in ~30 milliseconds regardless of the tested number, so this might be O(1) until some bottleneck kicks in. Though I have yet to verify the complexity as the quality of division rule depends on a,b and c ranges.
    Edit: after some testing it’s some logarithmic complexity when P is bigger than 10^2000

    P size, time seconds
    10^3000, 3.11
    10^4000, 6.43
    10^5000, 11.27
    10^6000, 17.69
    10^7000, 26.31
    10^8000, 37.09
    

    Plotting these gave about O(log(P)^2.5)
    The bRange, math.gcd() and reciprocal scale with P digit count but rest of the calculations are O(1).
    I have no idea why you would need 10^8000 divisibility rule designed hand calculations, but you can get one under a minute and this isn’t even multithreaded!


  • Funnily enough, I just sped up my own solution by 25000% without compromising anything.
    https://pastebin.com/Dkbq2chV

    I realized that multiplying the divisor P by its non-zero reciprocal digits, gets you near 10^n which are ideal numbers for the divisibility rules. Which should have been obvious since n * (1/n) = 1, and cutting off the reciprocal results in approximation of 1, which can be scaled by 10^b.
    e.g. finding divisibility rules for 7

    1/7=0.14285...
    7*14=98
    7*143=1001
    7*1429=10003
    

    The first script was very naive brute force approach.
    So instead of searching every combination of a, b and c, I can just check the near multiples of P*reciprocal.
    The variables can be solved by P*N = a*10^b + c when b is given and a is 1 to 9
    7*1429=10003 would expand to P*N=1*10^4+3