Thanks! Regards,
C. F. Baptista On 13 January 2015 at 04:26, Isaiah Norton <isaiah.nor...@gmail.com> wrote: > https://gmplib.org/ > > On Mon, Jan 12, 2015 at 10:25 PM, Carlos Baptista <caluci...@gmail.com> > wrote: > >> Oh nice, I just did factorial(1000000) and it actually produced an >> answer. What kind of arcane magic is used to make this possible? >> >> Regards, >> >> C. F. Baptista >> >> On 13 January 2015 at 04:22, Erik Schnetter <schnet...@gmail.com> wrote: >> >>> julia> factorial(big(171)) >>> >>> 1241018070217667823424840524103103992616605577501693185388951803611996075221691752992751978120487585576464959501670387052809889858690710767331242032218484364310473577889968548278290754541561964852153468318044293239598173696899657235903947616152278558180061176365108428800000000000000000000000000000000000000000 >>> >>> > On Jan 12, 2015, at 22:17 , Isaiah Norton <isaiah.nor...@gmail.com> >>> wrote: >>> > >>> > julia> factorial(big(21)) >>> > 51090942171709440000 >>> > >>> > (Julia doesn't auto-promote) >>> > >>> > On Mon, Jan 12, 2015 at 10:10 PM, Carlos Baptista <caluci...@gmail.com> >>> wrote: >>> > I understand that factorial(21) is quite a large number and therefore >>> an OverflowError is perfectly understandable. However, with Octave I can go >>> up to factorial(170) (if I go higher I receive Inf). Is there a way to go >>> beyond factorial(20) in Julia? >>> >>> -- >>> Erik Schnetter <schnet...@gmail.com> >>> http://www.perimeterinstitute.ca/personal/eschnetter/ >>> >>> My email is as private as my paper mail. I therefore support encrypting >>> and signing email messages. Get my PGP key from http://pgp.mit.edu/. >>> >>> >> >
