Smallest multiple: Difference between revisions
→OCaml: add
(Added Quackery.) |
(→OCaml: add) |
||
Line 196:
{{out}}
<pre>232792560</pre>
=={{header|F_Sharp|F#}}==
Line 210 ⟶ 209:
232792560
</pre>
=={{header|Factor}}==
{{works with|Factor|0.98}}
Line 366:
lcm(x) = 151117794877444315307536308337572822173736308853579339903227904473000476322347234655122160866668946941993951014270933512030194957221371956828843521568082173786251242333157830450435623211664308500316844478617809101158220672108895053508829266120497031742749376045929890296052805527212315382805219353316270742572401962035464878235703759464796806075131056520079836955770415021318508272982103736658633390411347759000563271226062182345964184167346918225243856348794013355418404695826256911622054015423611375261945905974225257659010379414787547681984112941581325198396634685659217861208771400322507388161967513719166366839894214040787733471287845629833993885413462225294548785581641804620417256563685280586511301918399010451347815776570842790738545306707750937624267501103840324470083425714138183905657667736579430274197734179172691637931540695631396056193786415805463680000
</syntaxhighlight>
=={{header|Mathematica}} / {{header|Wolfram Language}}==
<syntaxhighlight lang="mathematica">LCM @@ Range[20]</syntaxhighlight>
Line 372 ⟶ 373:
232792560
</pre>
=={{header|OCaml}}==
<syntaxhighlight lang="ocaml">let rec gcd a = function
| 0 -> a
| b -> gcd b (a mod b)
let lcm a b =
a * b / gcd a b
let smallest_multiple n =
Seq.(ints 1 |> take n |> fold_left lcm 1)
let () =
Printf.printf "%u\n" (smallest_multiple 20)</syntaxhighlight>
{{out}}
<pre>232792560</pre>
=={{header|Pascal}}==
Line 717 ⟶ 734:
for 20, it's 232792560
</pre>
=={{header|Phix}}==
Line 812 ⟶ 828:
=={{header|Quackery}}==
<code>lcm</code> is defined at [[Least common multiple#Quackery]].
Line 866 ⟶ 881:
done...
</pre>
=={{header|Verilog}}==
| |||