mersenneforum.org  

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

Reply
 
Thread Tools
Old 2003-09-15, 20:07   #12
NickGlover
 
NickGlover's Avatar
 
Aug 2002
Richland, WA

22·3·11 Posts
Default

Quote:
Originally posted by smh
If it takes 1 minute to test for 6 missing digits it will take about 190 years to test for 14 missing digits.

I't might be faster to rerun P-1 with high memory limits to see if the factor can be found again.
GP2 was implying that the three factors in question might be bogus. I was simply pointing out that he had not done enough testing to be sure of that.

We have the smallest factors of the exponents in question which I'm fairly certain did come from P-1. There is no need to redo the P-1 test unless someone really wants to see the original composite factor that was found.

Last fiddled with by NickGlover on 2003-09-15 at 20:09
NickGlover is offline   Reply With Quote
Old 2003-09-15, 21:18   #13
GP2
 
GP2's Avatar
 
Sep 2003

29·89 Posts
Default

Quote:
Originally posted by Xyzzy
I can run those P-1s if someone tells me what the worktodo.ini line should be...

(I can't use Pfactor because I don't know what bit depth they were trial factored to, and I can't use Pminus1 because I don't know what bounds were used!)
Actually, I already started those P-1s on my machine.
No factor for the first one, second one will complete soon.

You can find out the depth that an exponent has been trial-factored to by doing:

Download the DECOMP.EXE program from mersenne.org
Download the latest version of nofactor.zip
unzip nofactor.zip # creates the file NOFACTOR.CMP

# Output lines of the form exponent,depth
# for all exponents between exponent1 and exponent2
# Output goes into a file called "nofactor"

decomp -n exponent1 exponent2


For those two exponents, they were both trial-factored to 65 bits.

But as I said, I already started the P-1 for those 2 exponents.

Last fiddled with by GP2 on 2003-09-15 at 21:19
GP2 is offline   Reply With Quote
Old 2003-09-15, 21:56   #14
NickGlover
 
NickGlover's Avatar
 
Aug 2002
Richland, WA

22·3·11 Posts
Default

Just to be clear, the exponents I am talking about, which do not need P-1 factoring are:

Code:
 8276539 103  DF  7411192628700266363789140779170  18-Nov-02 00:48  Team_Prime_Rib Tasuke18
17699497 103   F  8254656556609760068242738155742  26-Mar-03 08:12  Team_Prime_Rib KL_MLChan
18129493 103   F  8754500160125057908417949485956  24-Feb-03 07:26  curtisc        wde3100-09
The three above exponents all have factors listed in George's files.

I think GP2 is re-running the P-1 factoring on:

Code:
15370879 103   F  7757301118393895425291596492654  19-Sep-02 15:40  S09625         C2EE070A4
15729167 102   F  4489874295809814634906444128101  20-Sep-02 12:17  S09625         C2EE070A4
For these, bogus factors were returned, so it is a good idea to re-run P-1.
NickGlover is offline   Reply With Quote
Old 2003-09-16, 03:07   #15
GP2
 
GP2's Avatar
 
Sep 2003

258110 Posts
Default

M15370879 completed P-1, B1=195000, B2=4582500
M15729167 completed P-1, B1=195000, B2=4728750

No factors found.
GP2 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Composite P-1 factors not showing up under recently cleared exponents? ixfd64 PrimeNet 2 2018-02-28 07:54
[script] v4-style table of cleared exponents ixfd64 PrimeNet 1 2010-06-14 16:24
We lost some Cleared Exponents??? petrw1 PrimeNet 1 2007-04-30 17:35
Assigned [or cleared] exponents that are already obsolete GP2 Data 21 2003-10-21 03:58
Anomalous entries in assigned & cleared files GP2 Data 2 2003-09-09 14:40

All times are UTC. The time now is 09:31.

Wed Oct 28 09:31:32 UTC 2020 up 48 days, 6:42, 2 users, load averages: 1.52, 1.61, 1.58

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.