20090121, 16:51  #12 
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17×251 Posts 
There's probably not a hard limit, it's probably more about whether they're obviously submitting things known not to be prime, like this one, whereas someone like us with many primes might get away with a couple of typos or CPU errors producing primes.

20090123, 11:45  #13 
May 2008
Wilmington, DE
5422_{8} Posts 
I was submitting a prime when the 3MM digit prime was being verified. I emailed Dr Caldwell because my prime was taking over 7 hours to verify. Dr Caldwell was none to happy about the 3MM digit prime because it was tying up the verification process on other submissions. He told me he had to put another machine on doing verifications because this prime had everything stymied. So, he knows about it.

20090124, 18:55  #14 
Sep 2004
101100001110_{2} Posts 
Who got an email from Dr Caldwell about Musatov false primes? He is asking for help to deal with this type of situation.

20090124, 23:00  #15  
May 2007
Kansas; USA
23556_{8} Posts 
Quote:
I got that Email. I was also the one who notified him early this morning to delete Mustov, all of his accounts, and all of his obviously composite entries. He did just that. I'm sure he'd like if I posted his Email here since he is asking for help, so here is a cutandpaste of it: Quote:
To try to help out and allow an early deletion of the 1st large entry with no small factors, I sieved it to P=25G; no factors found. I then sieved the GFN that was taking all of last night to primality test to P=20*10^15 (20 quadrillion) over night on a very slow machine. Unfortunately, also no small factors. I stopped it after he went ahead and deleted the entry anyway. I don't know what else to suggest to him than what he has already come up with above. If anyone else has any ideas, I'm sure he would appreciate it. Gary Last fiddled with by gd_barnes on 20090124 at 23:02 

20090125, 03:35  #16 
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17·251 Posts 
Maybe automatically block any account with the name Musatov. (If there happens to be another Musatov that's a legitimate prime finder, he can contact you.)
Maybe some sort of smarter priority for which submissions are checked first could at least minimize the impact on verifying real primes. Perhaps if somebody has more than one prime to verify or submits a large prime (over position 1000? I don't really know what would be a very reasonable amount), it would require Dr Caldwell's approval to verify. Or instead of simply 'more than one' or 'over position x', something that estimates the verification time for all submitted primes as 'over time x', i.e. if it'll take a while to verify all prime(s) make Caldwell have to okay it first; since this won't happen as often as every single prime, it wouldn't be unreasonable to force an extra wait for those before it shows up on the list. This would have to consider primes submitted separate times in addition to multiple primes at once. Last fiddled with by MiniGeek on 20090125 at 03:36 
20090125, 08:43  #17 
Just call me Henry
"David"
Sep 2007
Cambridge (GMT)
2^{4}×353 Posts 

20090125, 09:04  #18 
Just call me Henry
"David"
Sep 2007
Cambridge (GMT)
2^{4}×353 Posts 
for some reason i cant submit my new prime
is this something to do with the composites problem? only two have been submited today and they were really early today edit: wierd tried again and the username and password box appeared this time Last fiddled with by henryzz on 20090125 at 09:26 
20090125, 13:42  #19 
I quite division it
"Chris"
Feb 2005
England
100000011101_{2} Posts 
Maybe each prime submitted over a certain size has to be 'countersigned' by someone already on the list. The person already on the list gets an email, when they reply with their password or something the primechecking starts. Sounds a bit clumsy though.
Last fiddled with by Flatlander on 20090125 at 14:19 Reason: typo 
20090408, 03:05  #20 
May 2008
Wilmington, DE
2×13×109 Posts 
Didn't know where to post this so I'll put it here. Maybe we need a Mathematics for Dummies thread.
Question #1 for MFD: If twins are in the form of k*2^n1 and k*2^n+1, then why don't we test all our prime found to see if it is a twin? Please remember geniuses, this is Mathematics for Dummies and I epitomize the title. 
20090408, 04:55  #21  
May 2007
Kansas; USA
2·7^{2}·103 Posts 
Quote:
It actually required no testing. I just cutandpasted lists of Riesel and Proth primes up to that limit into a spreadsheet and matched them up. Proth primes can be found at www.prothsearch.net. The largest twin that I found in doing this comparison was 915*2^11455+1 and 1. It had already been found, much to my chagrin. I found many more larger twins for higher k's. See below. The chances of a prime found having a twin for n>260K are EXTREMELY remote. The largest twin at this point in history is at n=195K. It has a 10digit k. In order for k*2^n+1 and k*2^n1 to be prime the kvalue must be divisible by 3. So if you're up for comparing the Riesel and Proth lists, limit your comparison to k's divisible by 3 and n>260K. With the few # of primes for n>260K and only 200 k's to check (600 odd k's divided by 3), you'll quickly see that far more k's are needed to have a reasonable shot at a twin. Now...if you want to expand your search beyond the Prothsearch list, you could use the top5000 site and test all Riesel's for any kvalue that is divisible by 3. I think Karsten has probably done something along these lines too. You might also check with him. One more thing: I think you might find a couple of my web pages interesting: Twins for k<100K and n<48K: http://gbarnes017.googlepages.com/twins100K.htm Twins for k<1M and n=10K48K: http://gbarnes017.googlepages.com/twins1M.htm I have sieved files up to n=60K for these efforts. n=48K52K is in midstream of testing on one of my quads. I stopped it about 78 months ago to focus on NPLB and CRUS. Gary 

20090408, 05:08  #22 
May 2008
Wilmington, DE
2×13×109 Posts 
Thanks Gary.
So basically, if I find a prime with a k divisible by 3, I could test for a twin but probably won't find one. Can't hurt though. I may even find one. 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Mersenne Primes p which are in a set of twin primes is finite?  carpetpool  Miscellaneous Math  3  20170810 13:47 
Distribution of Mersenne primes before and after couples of primes found  emily  Math  34  20170716 18:44 
Thread for posting tiny primes  3.14159  Miscellaneous Math  945  20150726 21:43 
possible primes (real primes & poss.prime products)  troels munkner  Miscellaneous Math  4  20060602 08:35 
Deutscher Thread (german thread)  TauCeti  NFSNET Discussion  0  20031211 22:12 