Idle curiosity: How to covert a huge prime to acutal digits for viewing?

[dans]

How would one go about converting the formula 2^33219278-1 (Or any huge power for that matter) into the actual digits?

I understand the basic mathmatics, I also understand that it will be 10's of millions of digits long, I am just wonder how I get my computer to display all of the actual digits? Excel just laughs at my attemp of entering =2^33219278 it just results in an error :) How does one go about doing this?

Thanks!
-Dan

[sdbardwick]

Take a look here: http://www.apfloat.org/apfloat/

You'll probably want this file (there is a readme in the .zip): http://www.apfloat.org/apfloat/mprintc5.zip

[dans]

Perfect, thank you!

Originally Posted by sdbardwick

Take a look here: http://www.apfloat.org/apfloat/

You'll probably want this file (there is a readme in the .zip): http://www.apfloat.org/apfloat/mprintc5.zip

[sdbardwick]

No problem! Glad to help. Props to Xyzzy for originally prompting me to bookmark the site...

[jinydu]

Strange, it just downloads a file with 0 bytes!

[sdbardwick]

Originally Posted by jinydu

Strange, it just downloads a file with 0 bytes!

Just worked fine for me. Do you have any anti-virus software set to block downloading of zip files?

[jinydu]

Don't think so, I've succeeded in downloading other zip files before.

[juergen]

Originally Posted by sdbardwick

Take a look here: http://www.apfloat.org/apfloat/

You'll probably want this file (there is a readme in the .zip): http://www.apfloat.org/apfloat/mprintc5.zip

Hi, I just read this. Does anybody know which multi precision package is the fastest for large integer operations. Especially for "exponential residue" calculations (I don''t know if this is the correct name) I mean calcualtions like the ones which have to be done to use the Little Theorem of Fermat (a^(p-1) mod p)?

Is apfloat faster or slower for this type of calculation?
Are there even faster libraries for this type of calculation?
I use a Pentium Processor at the moment.

[ET_]

Originally Posted by juergen

Hi, I just read this. Does anybody know which multi precision package is the fastest for large integer operations. Especially for "exponential residue" calculations (I don''t know if this is the correct name) I mean calcualtions like the ones which have to be done to use the Little Theorem of Fermat (a^(p-1) mod p)?

Is apfloat faster or slower for this type of calculation?
Are there even faster libraries for this type of calculation?
I use a Pentium Processor at the moment.

I have been told that GMP (Gnu Multi Precision) library (http://www.swox.com/gmp) is among the fastest. It is partially coded in Assembly language, and makes use of hardware optimizations like MMX and SSE2 registers. I also guess that such algorithm would be easy (although not trivial) to code with GMP.

Luigi