[Scilab-users] [SEP] factorial() extension on [171, 10^14]

[Rafael Guerra]

Hi Samuel,

How are in the proposed extension the resulting very large numbers represented?
In other words, how are the limitations of double precision overcome and can we do math with such very large integers?

PS: In Scilab the gammaln() function allows computing the logarithm of the factorial for large integers.

Regards,
Rafael

-----Original Message-----
From: users [mailto:users-bounces at lists.scilab.org] On Behalf Of Samuel Gougeon
Sent: Friday, May 04, 2018 3:32 PM
To: International users mailing list for Scilab. <users at lists.scilab.org>
Subject: Re: [Scilab-users] [SEP] factorial() extension on [171, 10^14]

Le 14/04/2018 à 15:44, Samuel Gougeon a écrit :
> While fixing the bug 7562 about a bad memory usage by factorial(),
>
> i was wondering about the poor factorial() result, since currently it 
> can process only integers in [0, 170] before saturating and returning 
> %inf.
>
> This Scilab Enhancement Proposed (SEP) aims to extend factorial() to 
> all integers in [0, 10^4].
>

The proposed extension goes up to n=10^14 (not 10^4)

Samuel

_______________________________________________
users mailing list
users at lists.scilab.org
http://lists.scilab.org/mailman/listinfo/users