i want a shower gel that can also be used as face wash. im too lazy

bouta go take a 🛁

probably the key is “Euclidean theorem”:
gcd(a, b) = gcd(b, a mod b).

i.e., the gcd of two numbers equals the gcd of some smaller numbers.
smtg like gcd(32, 24) equals gcd(24, 8).

the algorithm may be based on this theorem.
so the question is why this holds.

i’m currently researching the Euclidean algorithm

function gcd(a, b) {
if (b === 0) {
return Math.abs(a);
}

return gcd(b, a % b);
}

but haven’t figured it out yet.
seems this can also be applied to polynomials n is related to Bézout’s identity etc., tho.

bear’s basking in the sun on my table

actually it was 12,000 JPY.

from now on i’ll tweet ¥100 as $1 for the best understanding.

bought a Nitori gaming floor chair $120.
⭐☆☆☆☆
this isn’t supposed to be put on a mattress.
hard n uncomfortable.
all i rlly wanted was a backrest.

slept today too
slept at 20:00 woke up at 4:00