I am investigating 64-100 sequences, which are chains of bases such that the number written 100 in each is written 64 in the next (e.g. 8,10,16,42). I quickly wrote a Python program to compute them. It is now computing the square of a 1555000 digit number and has been doing so since the 17th. What squaring algorithm is Python using? Is there a faster way of squaring numbers where the number of digits doubles at each iteration?
phma -- .i toljundi do .ibabo mi'afra tu'a do .ibabo damba do .ibabo do jinga .icu'u la ma'atman. _________________________________________________________________________ Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
