![]() |
|
|
#1 |
|
Oct 2017
++41
12510 Posts |
Hi,
I'm new to GIMPS and I have a question: When I sign up for the 100M-digit search, I get a 332M exponent. Why doesn't the search start by default at 100M? And an OT question: How much performance do I lose if I run 1 worker +3 helper threads vs. 4 workers on a 4 core Haswell i5-4690K? |
|
|
|
|
|
#2 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
250416 Posts |
Try a simple calculation on your pocket calculator:
- Do 2*2*2*...*2 (10 times). That's 210. How many digits does the answer have? - Then do 2*2*2*...*2 (33 times). That's 233. How many digits does the answer have? Now, observe that if you do the same 100M times and 332M times, you will get answers 10M times larger. See? |
|
|
|
|
|
#3 | |
|
Serpentine Vermin Jar
Jul 2014
CEF16 Posts |
Quote:
) will have over 100 million decimal digits.Maybe it's confusing to a newcomer to casually talk about 100M and 332M without knowing just what those #'s represent, but you definitely came to the right place to ask. Hope that helps. |
|
|
|
|
|
|
#4 |
|
Oct 2017
++41
1758 Posts |
Ah thank you, it's clear now.
|
|
|
|
|
|
#5 |
|
Einyen
Dec 2003
Denmark
35×13 Posts |
Log2(10100,000,000) = log10(10100,000,000) / log10 2 = 100,000,000 / log10 2 ~ 100,000,000 / 0,301030 ~ 332,192,809
|
|
|
|
|
|
#6 |
|
"Composite as Heck"
Oct 2017
81410 Posts |
I know it's been answered 3 different ways already, but this may be clearer: The >100M digit search refers to the number of decimal digits (probably coined because of the EFF prize), with 332M you're referring to the number of binary digits the exponent has.
Not to discourage you from doing what you want, but are you planning to do an LL test in the 100M range? If you've never done an LL test on the current wavefront, I suggest you try that first. Most people don't attempt or complete a 100M LL test because they take a very long time, and they're prone to fail even if taken to completion because of their length. Steps can be taken to mitigate a failed run (like ECC RAM or running the same test simultaneously, cross-checking as you go), but you'd have to be around a little while to know that. |
|
|
|
|
|
#7 |
|
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
23×1,223 Posts |
We do have some contextually important shorthand around here.
M7 can refer to M(7), that is 27-1 with M() standing for the Mersenne function. or The seventh known Mersenne prime. This is the usual usage for numbers under 100. The parenthesis are used to clarify normally. 79.3M, 332M, etc. normally refers to exponent range (with M standing in for million): 279,300,000 -1 However, if you see 1M, 10M, or 100M, that will most often refer to the Mersenne numbers that have a decimal expression in the 1, 10, or 100 million digit range. This usage is almost only used for these 3. If you see 70M or 90M and 100M used in the same discussion it will most likely mean the size of the exponent. Last fiddled with by Uncwilly on 2017-10-02 at 18:24 |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| ECM2 work assigned | stebbo | Software | 3 | 2016-12-27 23:08 |
| Work assigned to -Anonymous- | Siegmund | PrimeNet | 6 | 2016-09-06 02:25 |
| GPU72 out of 332M exponents? | Uncwilly | GPU to 72 | 16 | 2014-04-11 11:31 |
| How does the Odd Perfect Number search work? | jasong | Math | 5 | 2007-04-14 21:56 |
| How much work on Odd Perfect Number search? | jasong | GMP-ECM | 5 | 2007-04-11 03:00 |