On Tue, 14 Sep 2004 09:25:49 -0700 (PDT), jaya subba reddy <[EMAIL PROTECTED]> wrote: > > > I am sending my view which is related to the mersenne prime numbers. [snip]
The main idea seems to be that 3 log 10 is approximately 10 log 2. Jaya, to find the number of decimal digits in 2^n (integer n >= 0), use logarithms (pardon the Matlabese): d = floor( log(2) / log(10) * n ) + 1 _______________________________________________ Prime mailing list [EMAIL PROTECTED] http://hogranch.com/mailman/listinfo/prime
