:

Very useful, need an exponentless result of 2^43,112,609

Added by: ~Sanmayce, 2012 XI 05

Added by: ~Sanmayce, 2012 XI 05

Hi,
I salute you for making your calculator/library on-line, very useful.

I need to calculate all the digits of 2^43,112,609.
On August 23rd, 2008, a UCLA computer in the GIMPS PrimeNet network discovered the 45th (biggest so far (2010-July)) known Mersenne prime, 2^43,112,609-1, a mammoth 12,978,189 digit number!

2^43,112,609 =
3.1647026933025592314345372394933751605410618847526464414030 417673281124749306936869204318512161183785672681653998546509 73561234326451796738535905772383134e+12978188

Sadly I use C only. My dummy console x^y calculator is at:
http://www.overclock.net/t/1322276/high-precision-program-th at-calculates-2-n/0_20#post_18524890

Any ideas how to speed it up.

Added by: tomek, 2012 XI 12

in ttmath it would be like:

#include "ttmath/ttmathuint.h"

int main()
{
ttmath::UInt<673636> a, b;

a = 2;
b = 43112609;

if( a.Pow(b) )
std::cout << "ops, the size is too small (carry)" << std::endl;
else
std::cout << a << std::endl;

}

and it gives:
http://tmp.slimaczek.pl/tmp/two_to_43112609.txt

The problem is actually with printing this value in the decimal form, it takes time.