i want a shower gel that can also be used as face wash. im too lazy pic.twitter.com/abzlZowuJl
posted at 16:08:48
bouta go take a 🛁
posted at 14:27:14
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.
posted at 11:40:02
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.
posted at 11:06:05
bear’s basking in the sun on my table
posted at 08:24:17
actually it was 12,000 JPY. from now on i’ll tweet ¥100 as $1 for the best understanding.
posted at 06:41:16
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. pic.twitter.com/KTWZ3wJO1n
posted at 06:21:07
slept today too slept at 20:00 woke up at 4:00
posted at 05:50:38