Revision as of 04:00, 27 May 2021 (view source) JoeStrout (talk \| contribs) (added MiniScript example) ← Older edit		Revision as of 04:05, 27 May 2021 (view source) JoeStrout (talk \| contribs) m (→‎{{header\|MiniScript}}) Newer edit →
Line 2,701: =={{header\|MiniScript}}== Using an iterative Euclidean algorithm: <lang MiniScript>gcd = function(a, b) while b

Greatest common divisor: Difference between revisions

Greatest common divisor (view source)