|
k=22544089918041953*E(130) generates 216 known primes
1 Attachment(s)
Perhaps some of you may have noticed the recent progress in the [URL="http://www.mersenneforum.org/showthread.php?t=9755"]Very Prime Riesel and Sierpinski k thread[/URL] started by Robert Smith.
About one month ago Robert found a Riesel k, a so called VPS (Very Prime Series), for which we discovered [B]201 primes[/B] so far (up to n=480k). This is quite extraordinary, since there are no other known series with 200 primes so far (actually no other series has 183 or more known primes). Since our resources are limited we are offering this k to the RPS community. The candidate is [B]k=22544089918041953*3*5*11*13*19*29*37*53*59*61*67*83*101*107*131[/B] (=1480472640274704456611717878515654164205), a 40 digits number. Its [B]Nash weight is 8818[/B] (= "very high"). Now the unpleasant facts about this k: [STRIKE]LLR cannot handle such large values of k, therefore one has to use PFGW.[/STRIKE] A single LLR test or a PRP test using PFGW typically takes 4-5 times as long as a LLR test for an "ordinary" k of 3-5 digits having the same n. The attached file contains the range n=500-800k sieved up to p=6.34T, which should keep us busy for a while. Please help yourself to pick a suitable range for your machine(s). Well, there would be no Top5000 credit for primes found in this range. But with your help we could drive this k into the megabit range quite soon! [B]Status[/B] [CODE] Range Tested by Status 1-250,000 - Robert - Complete (191 primes) 250,001-500,000 - Thomas - Complete (14 primes) 500,001-600,000 - Lennart - Complete (4 primes) 600,001-610,000 - Antonio - Complete (2 primes) 610,001-612,000 - lsoule - Complete 612,001-614,000 - Robert - Complete 614,001-620,000 - lsoule - Complete 620,001-630,000 - Batalov - Complete 630,001-635,000 - Antonio - Complete 635,001-640,000 - lsoule - Complete (1 prime) 640,001-730,000 - Batalov - Complete (1 prime) 730,001-732,000 - Kosmaj - Complete 732,001-740,000 - lsoule - Complete 740,001-742,000 - Antonio - Complete 742,001-750,000 - lsoule - Complete 750,001-770,000 - Thomas - Complete 770,001-775,000 - Antonio - Complete 775,001-780,000 - Trilo - Complete 780,001-790,000 - lsoule - Complete (1 prime) 790,001-792,000 - Robert - Complete 792,001-810,000 - lsoule - Complete 810,001-814,000 - Robert - Complete 814,001-840,000 - lsoule - Complete (1 prime) 840,001-842,000 - Robert - Complete 842,001-880,000 - lsoule - Complete 880,001-882,000 - Robert - In Progress 882,001-890,000 - lsoule - Complete 890,001-904,000 - lsoule - Complete 1,000,001-1,030,000 - Batalov - Complete (1 prime) [/CODE] [B]Input files[/B] (in the attached 22544.zip file): 22544mi790to800sv_6340B.txt ... pfgw input file in ABC format (790-800k) 22544mi800to1000sv_9600B.txt ... pfgw input file in ABC format (800-1000k) llr_input_790to1000.txt ... LLR input file in NewPgen format (790-1000k) llr_input_1030to1200.txt ... LLR input file in NewPgen format (1030-1200k) |
I think it would be best to take 2,000 n blocks to begin with. For example 500-502.
I am just finishing off 228,000-250,000, and Thomas11 has a little bit to do in his range, and therefore there may be more than 201 primes at 500000. |
A test at n=500,000 take about 520 seconds, on a 2500K at stock clock.
|
This morning another prime (actually a PRP) popped up for [B]n=496187[/B].
[B]202 primes[/B] now! |
I have posted the discovery this morning on the Yahoo Primeform group, with a short history of the search.
[URL]http://tech.groups.yahoo.com/group/primeform/message/11407[/URL] the primes found to date: [CODE]1 1 2 2 3 11 4 14 5 16 6 36 7 41 8 52 9 53 10 64 11 65 12 73 13 75 14 80 15 91 16 124 17 131 18 140 19 156 20 158 21 166 22 170 23 189 24 194 25 223 26 224 27 233 28 240 29 250 30 275 31 284 32 288 33 354 34 374 35 405 36 478 37 486 38 489 39 498 40 500 41 521 42 527 43 556 44 562 45 591 46 596 47 623 48 642 49 643 50 650 51 708 52 802 53 839 54 850 55 867 56 883 57 960 58 985 59 1003 60 1070 61 1108 62 1173 63 1207 64 1238 65 1276 66 1322 67 1361 68 1374 69 1375 70 1509 71 1570 72 1592 73 1636 74 1717 75 1720 76 1800 77 1808 78 1999 79 2150 80 2251 81 2352 82 2373 83 2550 84 2576 85 2596 86 2692 87 2697 88 2791 89 2956 90 3076 91 3178 92 3325 93 3590 94 4221 95 4327 96 4344 97 4385 98 4505 99 4585 100 4913 101 5217 102 5599 103 6478 104 6864 105 7089 106 7106 107 8140 108 8382 109 8528 110 8784 111 8787 112 9399 113 11069 114 11311 115 11853 116 14292 117 15198 118 15320 119 15825 120 15999 121 17570 122 17840 123 17887 124 17935 125 18401 126 20262 127 20460 128 20503 129 22568 130 22887 131 25002 132 26252 133 26523 134 27251 135 28233 136 29803 137 30173 138 31212 139 31424 140 32583 141 33696 142 36106 143 36320 144 40172 145 42457 146 44900 147 46170 148 46787 149 47920 150 49784 151 53246 152 55579 153 59638 154 60260 155 64574 156 67190 157 67470 158 71221 159 73142 160 77776 161 80678 162 84684 163 87557 164 96045 165 102231 166 102651 167 104202 168 104655 169 111235 170 111239 171 118689 172 119254 173 129630 174 134337 175 134490 176 141805 177 146149 178 159874 179 163330 180 168072 181 174712 182 177119 183 177684 184 190958 185 193804 186 197942 187 210616 188 226559 189 227776 190 229069 191 245288 192 255530 193 294807 194 318934 195 334623 196 334645 197 363020 198 376732 199 403709 200 414907 201 449150 202 472040 203 479697 204 496187 205 498496 206 517692 207 531133 208 549598 209 587833 210 608207 211 608462 212 639888 213 716611 214 788439 215 834442 216 1025897 [/CODE][B]Current total: 216 primes[/B] |
190th prime...203 overall
The table I published is out of date again.
[B]190 229069[/B] That makes 203 primes to date |
[QUOTE=firejuggler;347787]A test at n=500,000 take about 520 seconds, on a 2500K at stock clock.[/QUOTE]
Or 2.5 days per range of 2000 n, which has about 400 tests |
I'll do some work when I come back(mid august). Right now, my core are used.
|
Reserving
500,001-600,000 - Lennart |
I've updated my [url=http://www.rieselprime.de/Related/RieselPayam.htm]Riesel-Payam page[/url] with this record holder.
|
Another prime found: [B]204? 498496[/B] :smile:
250,001-500,000 completed (14 primes). |
Reserving
600,001-610,000 |
Now 205 primes
Welcome to the new searchers!
I expect that Carlos Rivera will update the puzzle page within the next day or so [url]http://www.primepuzzles.net/puzzles/puzz_006.htm[/url] In the meanwhile another prime to announce: [B]191? 245288[/B] this means the mooted 200th is now 414907 |
No more primes in the 200-250K range - this is now complete.
|
Taking 610-612.
|
Result
n=608207 is prime :smile:
[CODE] Primality testing 22544089918041953*3*5*11*13*19*29*37*53*59*61*67*83*101*107*131*2^608207-1 [N+1, Brillhart-Lehmer-Selfridge] Running N+1 test using discriminant 41, base 1+sqrt(41) 22544089918041953*3*5*11*13*19*29*37*53*59*61*67*83*101*107*131*2^608207-1 is prime! (1740.1047s+0.0191s) [/CODE] |
Result
n=608462 is prime
[CODE] Primality testing 22544089918041953*3*5*11*13*19*29*37*53*59*61*67*83*101*107*131*2^608462-1 [N+1, Brillhart-Lehmer-Selfridge] Running N+1 test using discriminant 47, base 1+sqrt(47) 22544089918041953*3*5*11*13*19*29*37*53*59*61*67*83*101*107*131*2^608462-1 is prime! (1657.1454s+0.0030s) [/CODE] |
OMG, well done Antonio...207 primes and counting.
I'll take 612-614K |
610-612 complete, no primes.
Taking 614-620. |
[QUOTE=robert44444uk;349243]OMG, well done Antonio...207 primes and counting.
[/QUOTE] Didn't think I was going to get anything, but it's just like waiting for a bus - wait ages for one and two come together. :rolleyes: |
Primality testing 22544089918041953*3*5*11*13*19*29*37*53*59*61*67*83*101*107*131*2^531133-1 [N+1, Brillhart-Lehmer-Selfridge]
Running N+1 test using discriminant 7, base 1+sqrt(7) 22544089918041953*3*5*11*13*19*29*37*53*59*61*67*83*101*107*131*2^531133-1 is prime! (1873.5388s+0.0074s) Lennart |
I'll take 620-630, for kicks and giggles.
|
[QUOTE=Lennart;349279]Primality testing 22544089918041953*3*5*11*13*19*29*37*53*59*61*67*83*101*107*131*2^531133-1 [N+1, Brillhart-Lehmer-Selfridge]
Running N+1 test using discriminant 7, base 1+sqrt(7) 22544089918041953*3*5*11*13*19*29*37*53*59*61*67*83*101*107*131*2^531133-1 is prime! (1873.5388s+0.0074s) Lennart[/QUOTE] Well done Lennart, that's 208!! |
600,001-610,000 Range complete (2 Primes already reported)
Taking 630-635 |
614-620 complete, no primes.
Taking 635-640. |
Primality testing 22544089918041953*3*5*11*13*19*29*37*53*59*61*67*83*101*107*131*2^639888-1 [N+1, Brillhart-Lehmer-Self
ridge] Running N+1 test using discriminant 7, base 1+sqrt(7) 22544089918041953*3*5*11*13*19*29*37*53*59*61*67*83*101*107*131*2^639888-1 is prime! (7410.2605s+0.0208s) |
Will update on 620-630 here - almost done.
Taking 640-650. |
Taking 650-680.
|
[QUOTE=lsoule;349597]Primality testing 22544089918041953*3*5*11*13*19*29*37*53*59*61*67*83*101*107*131*2^639888-1 [N+1, Brillhart-Lehmer-Self
ridge] Running N+1 test using discriminant 7, base 1+sqrt(7) 22544089918041953*3*5*11*13*19*29*37*53*59*61*67*83*101*107*131*2^639888-1 is prime! (7410.2605s+0.0208s)[/QUOTE] This one will run and run! 209!!! |
[QUOTE=robert44444uk;347841]I have posted the discovery this morning on the Yahoo Primeform group, with a short history of the search.
[url]http://tech.groups.yahoo.com/group/primeform/message/11407[/url] the primes found to date: [CODE] 1 1 2 2 3 11 4 14 5 16 6 36 7 41 8 52 9 53 10 64 11 65 12 73 13 75 14 80 15 91 16 124 17 131 18 140 19 156 20 158 21 166 22 170 23 189 24 194 25 223 26 224 27 233 28 240 29 250 30 275 31 284 32 288 33 354 34 374 35 405 36 478 37 486 38 489 39 498 40 500 41 521 42 527 43 556 44 562 45 591 46 596 47 623 48 642 49 643 50 650 51 708 52 802 53 839 54 850 55 867 56 883 57 960 58 985 59 1003 60 1070 61 1108 62 1173 63 1207 64 1238 65 1276 66 1322 67 1361 68 1374 69 1375 70 1509 71 1570 72 1592 73 1636 74 1717 75 1720 76 1800 77 1808 78 1999 79 2150 80 2251 81 2352 82 2373 83 2550 84 2576 85 2596 86 2692 87 2697 88 2791 89 2956 90 3076 91 3178 92 3325 93 3590 94 4221 95 4327 96 4344 97 4385 98 4505 99 4585 100 4913 101 5217 102 5599 103 6478 104 6864 105 7089 106 7106 107 8140 108 8382 109 8528 110 8784 111 8787 112 9399 113 11069 114 11311 115 11853 116 14292 117 15198 118 15320 119 15825 120 15999 121 17570 122 17840 123 17887 124 17935 125 18401 126 20262 127 20460 128 20503 129 22568 130 22887 131 25002 132 26252 133 26523 134 27251 135 28233 136 29803 137 30173 138 31212 139 31424 140 32583 141 33696 142 36106 143 36320 144 40172 145 42457 146 44900 147 46170 148 46787 149 47920 150 49784 151 53246 152 55579 153 59638 154 60260 155 64574 156 67190 157 67470 158 71221 159 73142 160 77776 161 80678 162 84684 163 87557 164 96045 165 102231 166 102651 167 104202 168 104655 169 111235 170 111239 171 118689 172 119254 173 129630 174 134337 175 134490 176 141805 177 146149 178 159874 179 163330 180 168072 181 174712 182 177119 183 177684 184 190958 185 193804 186 197942 187 210616 188 226559 189 227776 190 229069 191 245288 192 255530 193 294807 194 318934 195 334623 196 334645 197 363020 198 376732 199 403709 200 414907 201 449150 202 472040 203 479697 204 496187 205 498496 206 531133 207 608207 208 608462 209 639888 [/CODE] [B]Current total: 209 primes[/B][/QUOTE] How reliable is pfgw pl? A.K. Devaraj |
[QUOTE=devarajkandadai;349650]How reliable is pfgw pl?
A.K. Devaraj[/QUOTE] What do you mean by "reliable"? Due to the size of k we run a PRP test first instead of a more demanding primality test (Brillhart-Lehmer-Selfridge). For a positive PRP test the BLS test is done manually afterwards. If it turns out prime, then it should be as "reliable" as if it would have been done by any other primality testing software (like LLR, Proth, Prime95, even if the latter are unable to test those numbers). |
Taking 680-720.
|
635-640 complete with the one prime reported.
|
[QUOTE=Thomas11;349655]What do you mean by "reliable"?
Due to the size of k we run a PRP test first instead of a more demanding primality test (Brillhart-Lehmer-Selfridge). For a positive PRP test the BLS test is done manually afterwards. If it turns out prime, then it should be as "reliable" as if it would have been done by any other primality testing software (like LLR, Proth, Prime95, even if the latter are unable to test those numbers).[/QUOTE] It is not true that LLR cannot test these numbers : Indeed, it cannot process the input file in ABC format, but it can process it in Newpgen format (k*2^n-1 whith k fixed) with k as a digit string, not in factorized form : 1:M:1:2:2 1480472640274704456611717878515654164205 1 1480472640274704456611717878515654164205 2 1480472640274704456611717878515654164205 11 1480472640274704456611717878515654164205 14 1480472640274704456611717878515654164205 16 1480472640274704456611717878515654164205 36 .................................................................... .................................................................... 1480472640274704456611717878515654164205 498496 1480472640274704456611717878515654164205 531133 1480472640274704456611717878515654164205 608207 1480472640274704456611717878515654164205 608462 1480472640274704456611717878515654164205 639888 I am presently verifying successfully your prime results with LLR Regards, Jean |
[QUOTE=Jean Penné;349691]It is not true that LLR cannot test these numbers : Indeed, it cannot process the input file in ABC format, but it can process it in Newpgen format (k*2^n-1 whith k fixed) with k as a digit string, not in factorized form : ...
I am presently verifying successfully your prime results with LLR Regards, Jean[/QUOTE] Thanks for this information, Jean! This is really good news! Many years ago I tried larger k in LLR and noticed that there was some limitation (maybe k<2^53, I can't remember). What is the current size limit for k in LLR? |
1 Attachment(s)
Here is for convenience the input file in NewPGen format needed for LLR. Please help yourself to cut out your ranges.
It would be nice if some of you could post some comparative timings for LLR and PFGW (PRP test). BTW.: I'm already running a new sieve for the candidates up to n=1M (I've completely underestimated your interest and machinery in this sub-project). The new sieve file will be ready for testing around Monday next week. |
22544089918041953*3*5*11*13*19*29*37*53*59*61*67*83*101*107*131*2^716611-1 is prime
|
Taking 720-730.
|
[QUOTE=Thomas11;349704]Here is for convenience the input file in NewPGen format needed for LLR. Please help yourself to cut out your ranges.
It would be nice if some of you could post some comparative timings for LLR and PFGW (PRP test). BTW.: I'm already running a new sieve for the candidates up to n=1M (I've completely underestimated your interest and machinery in this sub-project). The new sieve file will be ready for testing around Monday next week.[/QUOTE] Starting Lucas Lehmer Riesel prime test of 1480472640274704456611717878515654164205*2^498496-1 Using generic reduction AVX FFT length 48K, Pass1=256, Pass2=192 V1 = 5 ; Computing U0...done. 1480472640274704456611717878515654164205*2^498496-1 is prime! Time : 395.696 sec. I7-2700K at 4 GHz |
1 Attachment(s)
All done. (Attached)
|
[QUOTE=Thomas11;349698]Thanks for this information, Jean! This is really good news!
Many years ago I tried larger k in LLR and noticed that there was some limitation (maybe k<2^53, I can't remember). What is the current size limit for k in LLR?[/QUOTE] For k > 2^53, the use of generic modular reduction is required, so the calculus becomes 3 times slower, but it is due do the gwnum library usage, and PFGW has the same limitation! Regards, Jean |
My LLR ver. 3.8.8 on a 64bit Mac was crashing on these numbers, but ver. 3.8.9 works fine.
Exe times: n=498496, 424 sec n=730004, 965 sec (FFT len = 72k) The CPU is I5 at 2.7GHz (only one LLR client running on a 4-core machine) |
Good to see LLR can be used..here are my comparative times:
pfgw: 22544089918041953*3*5*11*13*19*29*37*53*59*61*67*83*101*107*131*2^612375-1 is composite: RES64: [29838CC7648D40C8] (930.6872s+0.1715s) LLR: 1480472640274704456611717878515654164205*2^612377-1 is not prime. LLR Res64: 1B0F6C3C8C558D4F Time : 800.448 sec Well done Batalov on doing a huge chunk of work, and a prime to boot. 210!!! |
Taking 730-732.
|
Primality testing 22544089918041953*3*5*11*13*19*29*37*53*59*61*67*83*101*107*131*2^517692-1 [N+1, Brillhart-Lehmer-Selfridge]
Running N+1 test using discriminant 7, base 1+sqrt(7) Generic modular reduction using generic reduction AVX FFT length 50K, Pass1=640, Pass2=80 on A 517824-bit number Calling Brillhart-Lehmer-Selfridge with factored part 99.97% 22544089918041953*3*5*11*13*19*29*37*53*59*61*67*83*101*107*131*2^517692-1 is prime! (1788.9399s+0.0009s) Lennart |
I ksieve'd for a day (to 1T only, n=1-1.2M) in the recordable range* and added this prime to the collection:
[URL="http://primes.utm.edu/primes/page.php?id=115092"]22544089918041953*3*5*11*13*19*29*37*53*59*61*67*83*101*107*131*2[SUP]1025897[/SUP]-1[/URL] I'll post the rest of the sieve, later. Will possibly sieve and run some more. |
Hi Batalov,
Congrats on a nice prime! Can you also include RPS in your new prover's code? Thanks! |
k=22544089918041953*E(130)
Sure thing. I emailed C.C. (and added a comment to the prime, too).
I put the asterisk in my morning message, but forgot to post the footnote. It is this: _______________________ *Note that the Top-5000 [URL="http://primes.utm.edu/primes/page.php?rank=5000"]cutoff plane[/URL] will pass exactly 1,000,000 bits today or tomorrow. For the record, right now it is still at 999,400 bits' size, but the 1,290,000-bits abominable primes keep on pouring in. Mark my words :paul: Next state of the Top5000 database will be that [B][I]all[/I][/B] primes from position ~1,500 to 5,000 will be ~1,290,000 bits. |
[QUOTE=Thomas11;349704]Here is for convenience the input file in NewPGen format needed for LLR. Please help yourself to cut out your ranges.
It would be nice if some of you could post some comparative timings for LLR and PFGW (PRP test). BTW.: I'm already running a new sieve for the candidates up to n=1M (I've completely underestimated your interest and machinery in this sub-project). The new sieve file will be ready for testing around Monday next week.[/QUOTE] Please update first post attachment. [url]http://www.mersenneforum.org/showpost.php?p=349704&postcount=36[/url] |
LLR vs PFGW timings on 1480472640274704456611717878515654164205*2^716611-1:
[B]Laptop i7 2720QM 2.20 Ghz:[/B] [U]LLR 3.8.9:[/U] Lucas Lehmer Riesel prime test: 1115 sec (deterministic) Strong Fermat PRP: 1422 sec Lucas PRP: 2837 sec Frobenius PRP: 1300 sec [U]PFGW 3.7.7:[/U] Strong Fermat PRP: 1215 sec [N-1, Brillhart-Lehmer-Selfridge] 1973 sec (still came out PRP even if it should be deterministic) [B]Q9450(Yorksfield) 2.66 Ghz:[/B] [U]LLR 3.8.9:[/U] Lucas Lehmer Riesel prime test: 2193 sec Strong Fermat PRP: 2179 sec Lucas PRP: 4746 sec Frobenius PRP: 2179 sec [U]PFGW 3.7.7:[/U] Strong Fermat PRP: 2229 sec [N-1, Brillhart-Lehmer-Selfridge] 3350 sec (came out as PRP) |
Taking 1000-1030, for the record.
|
[QUOTE=Jean Penné;349771]For k > 2^53, the use of generic modular reduction is required, so the calculus becomes 3 times slower, but it is due do the gwnum library usage, and PFGW has the same limitation!
Regards, Jean[/QUOTE] The slowdown seems to happen at a very specific k-value near 7.5*10[sup]14[/sup] or ~2[sup]49.4[/sup]: 750599937895082*2^498496-1, iteration : 10000 / 498497 [2.00%]. Time thusfar : 2.700 sec. 750599937895083*2^498496-1, iteration : 10000 / 498496 [2.00%]. Time thusfar : 9.986 sec. 750599937895081*2^716611-1, iteration : 10000 / 716611 [1.39%]. Time thusfar : 4.459 sec. 750599937895083*2^716611-1, iteration : 10000 / 716611 [1.39%]. Time thusfar : 15.067 sec. 750599937895086*2^1025897-1, iteration : 10000 / 1025898 [0.97%]. Time thusfar: 5.908 sec. 750599937895087*2^1025897-1, iteration : 10000 / 1025897 [0.97%]. Time thusfar: 21.928 sec. |
I added the LLR input file (in the n=730-800k range only) to the zip file in the top post.
BTW, if you find a reportable prime using LLR please give credit to ksieve instead of srsieve/Psieve. |
Taking 732-740
|
1 Attachment(s)
[QUOTE=Batalov;349829]Taking 1000-1030, for the record.[/QUOTE]
Done. Attached. (There's probably ~5-8% avoidable tests there; the input list was only sieved to 1T. With more sieving, there would be only ~1933 tests per each range of 10k; in the attached file, there are ~2090 per 10k.) |
The discussion about Top-5000 cutoff moved to a new thread:
[url]http://www.mersenneforum.org/showthread.php?t=18482[/url] [QUOTE=Batalov;349979]Sure thing. I emailed C.C. (and added a comment to the prime, too). I put the asterisk in my morning message, but forgot to post the footnote. It is this: _______________________ *Note that the Top-5000 [URL="http://primes.utm.edu/primes/page.php?rank=5000"]cutoff plane[/URL] will pass exactly 1,000,000 bits today or tomorrow. For the record, right now it is still at 999,400 bits' size, but the 1,290,000-bits abominable primes keep on pouring in. Mark my words :paul: Next state of the Top5000 database will be that [B][I]all[/I][/B] primes from position ~1,500 to 5,000 will be ~1,290,000 bits.[/QUOTE] |
The candidate is perhaps the first as well with 100 primes known wearing its base 4 mask. Interestingly out of the 212 primes found, 119 are translatable to base 4, and only 93 not.
I have a hunch that the mismatch is not random. Base 4 is an extremely interesting base to analyse. It is the first square base, and resultant on that no prime p has modulo of p-1. Generalised cunningham chains in square bases provide longer chains, and I think this is related to the last statement. |
I stopped the sieve for n=800-1000k at p=9.6T (which is more than optimal) and updated the zip file (22544.zip) in the top post.
Sieving n=1.03-2M is already in progress... |
Output logging to file pfgw.out
Primality testing 22544089918041953*3*5*11*13*19*29*37*53*59*61*67*83*101*107*131*2^587833-1 [N+1, Brillhart-Lehmer-Selfridge] Running N+1 test using discriminant 7, base 1+sqrt(7) Generic modular reduction using generic reduction AVX FFT length 60K, Pass1=320, Pass2=192 on A 587965-bit number Calling Brillhart-Lehmer-Selfridge with factored part 99.98% 22544089918041953*3*5*11*13*19*29*37*53*59*61*67*83*101*107*131*2^587833-1 is prime! (2335.9659s+0.0007s) Lennart |
630000-635000 range completed - no primes.
|
732-740 complete, no primes
|
Primality testing 22544089918041953*3*5*11*13*19*29*37*53*59*61*67*83*101*107*131*2^549598-1 [N+1, Brillhart-Lehmer-Selfridge]
Running N+1 test using discriminant 7, base 1+sqrt(7) Generic modular reduction using generic reduction AVX FFT length 60K, Pass1=320, Pass2=192 on A 549730-bit number Calling Brillhart-Lehmer-Selfridge with factored part 99.98% 22544089918041953*3*5*11*13*19*29*37*53*59*61*67*83*101*107*131*2^549598-1 is prime! (1954.0706s+0.0007s) Lennart |
Taking 740-742
|
500,001-600,000 Complete
4 Primes found Lennart |
[QUOTE=Lennart;350435]500,001-600,000 Complete
4 Primes found Lennart[/QUOTE] Congrats to all the searchers, and well done Lennart. Let's get this done to 1 megabit and then we are in business with the top 5000. |
Taking 742-750
|
Taking 750-760.
|
Also taking 760-770.
|
740-742 Range complete, no primes.
Taking 770-775 |
Ill take 775k- 780k
|
730-732 complete, no primes.
|
742-750 complete, no primes.
Taking 780-790. |
612 to 614 complete. No primes found
|
1480472640274704456611717878515654164205*2^788439-1 is prime!
|
780-790 complete, 1 prime reported above.
|
I'll take 790 to 792
Regards Robert |
750-770 complete, no primes.
I've updated the input files in the top post of this thread. The ZIP file now additionally contains the range [B]n=1030-1200k[/B], sieved up to p=12.4T. |
770-775 Range complete, no primes.
|
775k-780k completed, no primes
|
I'll take 792-800
|
792-800 complete, no primes.
|
Taking 800-810.
|
800-810 complete, no primes.
|
790 to 792 complete. No primes.
|
Taking 810 to 812
|
810 to 812 completed, no primes.
Taking 812 to 814. It is taking me ages to run a range as I don't have access to a computer except during work hours. If anyone is able to devote some resources to getting to 1000K this would be more than appreciated. Then the search goes into the 5000 top prime list mode. |
Taking 814-820
|
814-820 complete, no primes.
Taking 820-830. |
820-830 complete, no primes.
|
Taking 830-840.
|
Thank you lsoule for your support.
I do fear we are falling behind the race to catch up with the top 5000. Any other resources people have to throw at this would be really appreciated, even if it means starting at 1.1 million. 812 - 814 at long last completed. No primes. I'll take 840-842 next. Regards Robert |
I'll take 842-850 as well.
|
842-850 complete, no primes. 830-840 still chugging away on a slower batch of machines. I'll take 850-860.
|
woo-hoo, one more popped out
1480472640274704456611717878515654164205*2^834442-1 is prime! |
congratz!
|
[QUOTE=lsoule;366305]woo-hoo, one more popped out
1480472640274704456611717878515654164205*2^834442-1 is prime![/QUOTE] Yay, this was a long gap in terms of time from the last prime!! Well done that lsoule. |
830-840 and 850-860 are now complete with the one prime reported.
Taking 860-870. |
| All times are UTC. The time now is 08:09. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2023, Jelsoft Enterprises Ltd.