Left factorials: Difference between revisions
Content added Content deleted
(Frink) |
|||
Line 1,576: | Line 1,576: | ||
=={{header|Frink}}== |
=={{header|Frink}}== |
||
Frink contains efficient algorithms for calculating and caching factorials and this program will work for arbitrarily-large numbers. |
|||
<lang frink>leftFactorial[n] := |
<lang frink>leftFactorial[n] := |
||
{ |
{ |
||
Line 1,635: | Line 1,637: | ||
10000 has 35656 digits |
10000 has 35656 digits |
||
</pre> |
</pre> |
||
=={{header|Go}}== |
=={{header|Go}}== |