Least common multiple: Difference between revisions
Added Uiua solution
(→{{header|Standard ML}}: add another SML version) |
(Added Uiua solution) |
||
Line 3,204:
0 OK, 0:330</pre>
=={{header|Uiua}}==
<syntaxhighlight lang="uiua">
# Greatest Common Divisor using Euclidean algorithm
Gcd ← ⊙◌⍢(⟜◿:|±,)
# Least Common Multiple
Lcm ← ÷⊃(Gcd|⌵×)
</syntaxhighlight>
=={{header|UNIX Shell}}==
<math>\operatorname{lcm}(m, n) = \left | \frac{m \times n}{\operatorname{gcd}(m, n)} \right |</math>
| |||