On Tue, 2004-09-14 at 20:35, Paul Leyland wrote: > On Tue, 2004-09-14 at 17:25, jaya subba reddy wrote: > > I am sending my view which is related to the mersenne prime numbers. > > Is this for real? > > The number of decimal digits of 2^x-1 is x /log(2) rounded up. > > Roughly speaking, x/0.30103 rounded up to the nearest integer.
My apologies to anyone I may have misled. For some reason I divided by log(2) when I should have subtracted. That is, the number of decimal digits of 2^x-1 is x *log(2) rounded up. Roughly speaking, x *0.30103 rounded up to the nearest integer. I so often do the computation the other way (converting digits to bits) that I gave the formula for the latter computation. Paul _______________________________________________ Prime mailing list [EMAIL PROTECTED] http://hogranch.com/mailman/listinfo/prime
