20031010, 05:42  #1 
11·331 Posts 
distribution of remaining candidates
paul, could you give us a table with
range of 1000  remaining candidates 700  75 701  69 .... 999  81 you knpw what i mean? the more remaining candidates in a range, the bigger the chance of a prime! thommy 
20031010, 11:30  #3 
2^{2}·3·149 Posts 
thanks
the tops are:
707 89 748 83 849 81 934 80 the bottoms: 852 45 860 45 749 46 901 47 i bet there is a prime in at least one block of the top 4. no doubt about it. 
20031010, 14:28  #4 
Sep 2002
Database er0rr
2^{2}×3×7^{3} Posts 
I have some doubt! I just hope we find another prime before n=1,000,000. Even two!
Everyone is free to "cherry pick" ranges. The time taken to test the smaller numbers is less. Perhaps some people will join in and bring with them their beginners luck! 
20031016, 21:18  #5 
Sep 2002
Database er0rr
2^{2}·3·7^{3} Posts 
I will be releasing all remaining candidate prime numbers in blocks of a 1000 range.
At n=700,000 a block of a 1000 range will take about 45 days on a P4 @ 2.4GHz  take into consideration the above table. I will try out a high block after I have finshed my current block. I will maintain the above table so that it reflects what is left 
20031018, 04:44  #6 
Jun 2003
3×23^{2} Posts 
Other methods to sieve
Once some of the lower candidates have been removed sieving again can reduce few more candidates. Also other methods should be tried to factor these numbers like P1 and ECM.
Good Luck with the project! I also hope you find 2 primes! Citrix 
20031018, 15:45  #7  
Sep 2002
Database er0rr
2^{2}·3·7^{3} Posts 
Quote:
Quote:


20031018, 21:26  #8 
Jun 2003
1587_{10} Posts 
P1
Paul,
You will have to write one for yourself. The algorithm of p1 is really simple but to optimize it for large numbers is the tricky part. The GIPMS and the SOB project use this code, you could ask them to share their source with you or modify their p1 client for you. Good luck! Citrix 
20031019, 00:39  #9  
"William"
May 2003
New Haven
2371_{10} Posts 
Quote:


20031019, 00:50  #10 
Jun 2003
3063_{8} Posts 
optimized?
wblipp,
Is the code optamized for such large numbers? Specially for numbers base 2. Citrix 
20031019, 01:05  #11 
Sep 2002
Database er0rr
10024_{8} Posts 
How do I perform p1 only with ecm?
wblipp, how did you run your run? I want to input a file of numbers. 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Conjectures with one k remaining  rogue  Conjectures 'R Us  109  20170429 01:28 
P1 factoring attempts at smallestremaining Mersenne numbers with no known factors  UberNumberGeek  Factoring  51  20170213 20:30 
20 Easy Pieces  The Remaining 29bit Jobs  swellman  XYYXF Project  5  20160227 22:35 
Discussion about CPU time needed and k's remaining  Siemelink  Conjectures 'R Us  41  20080711 23:05 
Easiest Remaining Cunninghams  R.D. Silverman  Factoring  1  20080312 03:34 