Very useful, need an exponentless result of 2^43,112,609
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!
3.1647026933025592314345372394933751605410618847526464414030 417673281124749306936869204318512161183785672681653998546509 73561234326451796738535905772383134e+12978188
Sadly I use C only. My dummy console x^y calculator is at:
Any ideas how to speed it up.
in ttmath it would be like:
ttmath::UInt<673636> a, b;
a = 2;
b = 43112609;
if( a.Pow(b) )
std::cout << "ops, the size is too small (carry)" << std::endl;
std::cout << a << std::endl;
and it gives:
The problem is actually with printing this value in the decimal form, it takes time.