20120926, 09:22  #34 
Banned
"Luigi"
Aug 2002
Team Italia
3·1,619 Posts 
So, AFAICT, MM43112609 has been "trialfactored" up to k=4, right?
What about MM42643801 and MM32582657? MM30402457 and MM25964951 Are at k=40 and k=44 respectively (thanks to Phil Moore). Luigi 
20120926, 09:26  #35  
Jun 2003
2^{2}·3^{2}·151 Posts 
Quote:
Code:
185*2^43112610369 completed P1, B1=10000, B2=300000, We1: 5B6E3988 201*2^43112610401 completed P1, B1=10000, B2=300000, We1: 5B6E3988 

20120926, 09:29  #36 
Jun 2003
2^{2}·3^{2}·151 Posts 

20120926, 09:34  #37 
Banned
"Luigi"
Aug 2002
Team Italia
3·1,619 Posts 
Code:
201*2^43112610401 completed P1, B1=10000, B2=300000, We1: 5B6E3988 Luigi 
20120926, 09:40  #38 
Banned
"Luigi"
Aug 2002
Team Italia
3×1,619 Posts 

20120926, 11:22  #39  
Jun 2003
12474_{8} Posts 
Quote:
Ok. After sieving to 3G, 42643801's lowest viable candidates are k={33,69,96}. So you can call it covered till k=32. I am doing 32582657 now. 

20120926, 11:40  #40 
Jun 2003
5436_{10} Posts 
After sieving to 4G, 32582657's lowest viable candidates are k={20,60,108}. So you can call it covered till k=19.

20120926, 12:14  #41  
Jun 2003
2^{2}·3^{2}·151 Posts 
Quote:
Code:
185 201 233 273 384 513 521 560 593 656 660 665 668 684 713 753 800 809 860 888 944 965 

20120926, 18:36  #42 
∂^{2}ω=0
Sep 2002
República de California
5×2,351 Posts 
Nice work on the sieve, guys  this matches my own factor.c sieve results for the smallerprimes prescreening. For q's passing the smallprime sieve we definitely want to sieve very deeply (by the standards of such sieves  even 2^64 is tiny relative to q here), in order to, say, double the odds of q being prime from {very tiny) to 2*(very tiny).
As has been noted elsewhere, once we've sieved/p1'd/ecm'ed q as deeply as we reasonably can, there is little point in attempting a direct nonfactorial compositeness test, since it is cheaper at that point to simply check whether q divides MMp. If q is composite it has no chance of dividing MMp; if q is prime it has at least a modest chance. 
20120927, 08:35  #43  
Banned
"Luigi"
Aug 2002
Team Italia
3×1,619 Posts 
Quote:
Should we proceed with PARI up to a defined level, or you may show us a better sieving method? Luigi 

20120927, 18:36  #44  
"Gary"
May 2007
Overland Park, KS
2^{2}×13×227 Posts 
Quote:


Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Is CEMPLLA 1.5 "the only software in the world capable of discovering" something? Not really.  CRGreathouse  Number Theory Discussion Group  51  20181216 21:55 
Official "World cup 2014/2018" teat  LaurV  Hobbies  74  20180711 19:33 
Problem E7 of Richard Guy's "Unsolved problems in number theory"  Batalov  Computer Science & Computational Number Theory  40  20130316 09:19 
Is the USA the "new" peacekeeper of the world??  outlnder  Soap Box  20  20050203 09:30 
Would Minimizing "iterations between results file" may reveal "is not prime" earlier?  nitai1999  Software  7  20040826 18:12 