Am 26.12.2011 um 12:00 schrieb Akos Marton:
> I was looking directly for some large factorial calculator in Octave and did
> not find any, hence took a while to find a solution.
Hi,
I once had a general solution for big factorials as an example for my students
in computer algebra. If this is of interest, I could write up the docstring for
it, tweak the function somewhat, and post it here. Right now it takes some 77
seconds to compute all 35660 digits of 10000!, but there's still some room for
improvement.
So, if anyone's interested, drop me a note!
Alex
--
Dr. Alexander Klein, Diplom-Mathematiker
Physiologisches Institut | TransMIT Zentrum
Raum 543 | für Numerische Methoden
Aulweg 129 | Heinrich-Buff-Ring 44
35392 Giessen | 35392 Giessen
------------------------------------------------------------------------------
Write once. Port to many.
Get the SDK and tools to simplify cross-platform app development. Create
new or port existing apps to sell to consumers worldwide. Explore the
Intel AppUpSM program developer opportunity. appdeveloper.intel.com/join
http://p.sf.net/sfu/intel-appdev
_______________________________________________
Octave-dev mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/octave-dev
