![]() |
![]() |
#1 |
Nov 2003
E2616 Posts |
![]()
The details are moved below the tables in an attempt to show latest information at the top of the screen.
Number of new primes found per k: Code:
51 1 249 57 3 261 5 117 5 267 5 129 3 273 3 135 6 279 6 213 3 285 3 237 3 291 11 Total: 57 Code:
Range of n Tested by Status 260,000-980,000 - RPS - Complete (56 primes found) 980,000-981,000 - LSoule - Complete 981,000-982,000 - amphoria - Complete 982,000-983,000 - PatrickSchmeer - Complete 983,000-984,000 - AES - Complete 984,000-985,000 - Bmaxx - Complete 985,000-987,000 - amphoria - Complete 987,000-988,000 - Retep - Complete 988,000-989,000 - PatrickSchmeer - Complete 989,000-990,000 - Kosmaj - Complete 990,000-991,000 - AES - Complete 991,000-992,000 - amphoria - Complete 992,000-993,000 - Bmaxx - Complete 993,000-994,000 - amphoria - Complete 994,000-995,000 - PatrickSchmeer - Complete 995,000-996,000 - Joshua2 - Complete 996,000-997,000 - amphoria - Complete (Prime: 291 996371) 997,000-998,000 - Kosmaj - Complete 998,000-999,000 - Bmaxx - Complete 999,000-1,000,000 - Joshua2 - Complete 57 Primes Found Sieving stopped at 30T. ------------------------------------ In this drive, we'll search for k*2^n-1 primes for the following 14 k's < 300 divisible by 3: 51, 57, 117, 129, 135, 213, 237, 249, 261, 267, 273, 279, 285, 291. The range of exponents is denoted by n_min <= n <= n_max where n_max=1M while n_min for respective Ks is given below. k=213, n_min=250k k=237, 249, 261, 273, 279, 291, n_min=260k k=135, 267, n_min=300k k=129, n_min=398k k=57, n_min=400k k=117, n_min=438k k=285, n_min=470k k=51, n_min=475k With exception of k=129, for each k, n_min in the drive equals previously achieved n_max from our stats page. In case of k=129 we are leaving a 253-398k gap to be double-checked later. [It was most likely checked by Jeffrey who reported 5 primes, but there is no way to know because he hadn't reported the range he processed. Volunteers for double-checking are welcome.] Sieving has been done by amphoria, Larry, Thomas, segmtfault, Battlemaxx, and me. And recently by BlisteringSheep. Happy hunting! Last fiddled with by Kosmaj on 2008-07-06 at 14:54 |
![]() |
![]() |
![]() |
#2 |
Nov 2004
California
6A816 Posts |
![]()
Taking 260-262
|
![]() |
![]() |
![]() |
#3 |
Nov 2003
2·1,811 Posts |
![]()
I'm taking the next one, 262-264.
|
![]() |
![]() |
![]() |
#4 |
Nov 2004
California
32508 Posts |
![]()
Taking 264-266 as well
|
![]() |
![]() |
![]() |
#5 |
Nov 2003
1110001001102 Posts |
![]()
Taking 266-268.
|
![]() |
![]() |
![]() |
#6 |
Jun 2004
2×53 Posts |
![]()
taking 268to270
![]() |
![]() |
![]() |
![]() |
#7 |
Nov 2003
E2616 Posts |
![]()
Templus, welcome to the drive, and good luck!
|
![]() |
![]() |
![]() |
#8 |
Feb 2003
22·32·53 Posts |
![]()
Taking 270-272.
|
![]() |
![]() |
![]() |
#9 |
"Dave"
Sep 2005
UK
2·19·73 Posts |
![]()
Taking 272-274.
|
![]() |
![]() |
![]() |
#10 |
Nov 2003
2×1,811 Posts |
![]()
John taking 274-276.
|
![]() |
![]() |
![]() |
#11 |
Nov 2004
California
23×3×71 Posts |
![]()
260-262, 264-266 complete, no primes
Taking 276-280 (2 files) Last fiddled with by lsoule on 2006-11-14 at 00:24 Reason: took another file |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
2LMs with exponent divisible by 13 | Batalov | Cunningham Tables | 1 | 2011-04-14 10:23 |
Divisible by a Prime | davar55 | Puzzles | 13 | 2007-09-12 17:35 |
Divisible up to Square Root | davar55 | Puzzles | 3 | 2007-09-05 15:59 |
Divisible by 7 ? | davar55 | Puzzles | 4 | 2007-08-09 20:10 |
Divisible by 7 | davar55 | Puzzles | 3 | 2007-05-14 22:05 |