mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Software

Reply
 
Thread Tools
Old 2010-04-18, 01:21   #1
odin
 
Apr 2010

33 Posts
Default What minimum exponent would give 100M digit prime?

Hello All,

What minimum exponent value would give a 100M digit prime?

Also is there a calculator on the internet or that I could download that could give me the specific number that any exponent I use in the formula 2^P - 1?

Like to calculate the value of:

2^49254458 - 1?

Of course my computer's calculator gives infinity!!!!!

Thanks.

Last fiddled with by odin on 2010-04-18 at 01:22
odin is offline   Reply With Quote
Old 2010-04-18, 01:24   #2
CADavis
 
CADavis's Avatar
 
Jul 2005
Des Moines, Iowa, USA

2×5×17 Posts
Default

http://mersenne-aries.sili.net/digits.php calculate number of digits from an exponent

i think it something above 332,000,000 for the exponent to give a 100M digit mersenne number.
CADavis is offline   Reply With Quote
Old 2010-04-18, 01:28   #3
odin
 
Apr 2010

1B16 Posts
Default

Quote:
Originally Posted by CADavis View Post
http://mersenne-aries.sili.net/digits.php calculate number of digits from an exponent

i think it something above 332,000,000 for the exponent to give a 100M digit mersenne number.
Thanks. You are right. I don't think I will be winning that prize. lol
odin is offline   Reply With Quote
Old 2010-04-18, 02:22   #4
lfm
 
lfm's Avatar
 
Jul 2006
Calgary

52×17 Posts
Default

Quote:
Originally Posted by CADavis View Post
http://mersenne-aries.sili.net/digits.php calculate number of digits from an exponent

i think it something above 332,000,000 for the exponent to give a 100M digit mersenne number.
Its pretty easy if you have a proper calculator. Just 1e6*ln(10)/ln(2)=3321928.09 or so.
lfm is offline   Reply With Quote
Old 2010-04-18, 05:58   #5
Uncwilly
6809 > 6502
 
Uncwilly's Avatar
 
"""""""""""""""""""
Aug 2003
101×103 Posts

2×52×7×23 Posts
Default

332192831 is the first prime that is 100 M digits.
There is a thread for those that TF'ing those in the range.
Uncwilly is online now   Reply With Quote
Old 2010-04-18, 11:05   #6
10metreh
 
10metreh's Avatar
 
Nov 2008

2×33×43 Posts
Default

Quote:
Originally Posted by Uncwilly View Post
332192831 is the first prime that is 100 M digits.
[pedant]No, it's the first prime p such that log10(2p-1) > 99,999,999.[/pedant]
10metreh is offline   Reply With Quote
Old 2010-04-18, 11:09   #7
lfm
 
lfm's Avatar
 
Jul 2006
Calgary

6518 Posts
Default

Quote:
Originally Posted by lfm View Post
Its pretty easy if you have a proper calculator. Just 1e6*ln(10)/ln(2)=3321928.09 or so.
oops should be 1e8!
lfm is offline   Reply With Quote
Old 2010-04-18, 13:57   #8
Uncwilly
6809 > 6502
 
Uncwilly's Avatar
 
"""""""""""""""""""
Aug 2003
101×103 Posts

175628 Posts
Default

Quote:
Originally Posted by 10metreh View Post
[pedant]No, it's the first prime p such that log10(2p-1) > 99,999,999.[/pedant]
You didn't see my [lazy shorthand][/lazy shorthand]?
Uncwilly is online now   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Predict discovery date of the 1st 100M digit prime retina Lounge 47 2019-09-07 15:46
332.2M - 333.9M (aka 100M digit range) Uncwilly LMH > 100M 684 2018-07-01 10:52
Manual testing tab doesn’t give me the exponent i typed in. theboss24611 Information & Answers 7 2017-10-18 19:17
CPU time for 100M digit prime test biggerben Software 7 2014-10-24 05:47
100M digit prime Unregistered Information & Answers 10 2010-03-24 20:16

All times are UTC. The time now is 16:11.

Fri Jun 5 16:11:14 UTC 2020 up 72 days, 13:44, 0 users, load averages: 1.64, 1.55, 1.53

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.