aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

June 2018 Update

Browse source
This commit is contained in:
Ingy döt Net 2018-06-22 20:57:24 +00:00
parent ba8067c3b7
commit 22f33d4004
5278 changed files with 84726 additions and 14379 deletions
Download patch file Download diff file Expand all files Collapse all files

6
Task/Least-common-multiple/00DESCRIPTION
View file

@ -18,7 +18,7 @@ If you already have   ''gcd''   for [[greatest common divisor]], &nbsp
One can also find   ''lcm''   by merging the [[prime decomposition]]s of both   ''m''   and   ''n''.
;References:
*   [http://mathworld.wolfram.com/LeastCommonMultiple.html MathWorld].
*   [[wp:Least common multiple|Wikipedia]].
;See also:
*   MathWorld entry:   [http://mathworld.wolfram.com/LeastCommonMultiple.html Least Common Multiple].
*   Wikipedia entry:   [[wp:Least common multiple|Least common multiple]].
<br><br>