on OSes like windows, you have to rely on premade programs to make audio, which are often limited and incomplete. but turing-complete operating systems, such as linux, have no such limitations

yeah!!!

termux?

tip: open devtools (f12), and look in the network tab. it's the best!, especially for piracy!

pdf:

• direct: https://www.tandfonline.com/doi/pdfdirect/10.1080/03626784.2023.2272988?hmac=1741212765-2kfp%2FsqxeK2gtfr1xYcZE9y0eLlWEqnHhGuRu9%2B8sW8%3D
• reupload: https://files.catbox.moe/rxgejy.pdf

yup! but in an indirect way, it was done by duplicating the layer, setting it to grain extract, and shifting it.

dunno, really. here's my theory:
reddit allows you to "do" that, but it has no effect, other than showing that status. you can see it if you reload the page. lemmy actually lets you do that, thus i feel like i'm "spiting" reddit. more recently, it's more of a habit.

fun fact: it's a crime to not credit xkcd! see the bottom of the page.
also fun fact: it's a crime to use any work, except for when you have permission, and a few edge cases

yes, daala's bitstream isn't frozen, just transcode back to y4m before posting

gif? that was patented, and it is very dated nowadays, giving horrid quality. post your memes in theora, jpeg xl, or daala

cowthink

ha, it's on the other side

no. purposeful. but yes to your name

use the account of the guy you're buying from

unlike the courier transform, the fourier transform is reversible

you can download it, but you can't use it. so restrictive :(

mine

once it discovers that you aren't in the sudoers list, it prints the message, and then quits. any omniscient god will know.

downvotes with no explanation?

ohoho, this is pernicious (following the wikipedia article on rsa, to the letter >:), mostly c):

 undefined

        struct KeyPair generate_RSA_keypair() {
        struct KeyPair keypair;
        bigint p = generate_prime();
        bigint q = generate_prime();
        bigint n = p*q;
        bigint totient = (p-1) * (q-1);
        bigint e = 1;
        while (gcd(e, totient) != 1) {
            e++;
        }
        bigint d = modular_inverse(e, totient);
        keypair.n = n;
        keypair.e = e;
        keypair.d = d;
        return keypair;
    }