yuuki ゆうき(金野裕希)@yuukikonno@mastodon.social

pls use any of these in case of emergency or for search purposes.

here are some mirrors of my twitter:
- nitter https://nitter.net/yuuki26
- twilog https://twilog.togetter.com/yuuki26
- togetter https://togetter.com/li/2144709
- github https://github.com/yuuki26-230930/yuuki26-230930

- mastodon https://mastodon.social/@yuukikonno
- notestock https://notestock.osa-p.net/@yuukikonno@mastodon.social/view

today i went with squash

removed all non-code from my github.
so that ppl can easily see my substantial projects.
https://github.com/yuuki15?tab=repositories

only persimmon n pear this morning.

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.