Reserving S55 to n=500k (250-500k) for BOINC

R39 tested to n=100k (50-100k) (1-1.2M)

98 primes found, 322 remain in this range

Results emailed, Base released

Reserving R39 to n=100k (50-100k) (1.2-1.353M) for BOINC

R36 Update
 

No primes found; 39 sequences remain.
Testing at n = 194000; will continue.

S86 tested to n=1M (665k-1M)

nothing found, 1 remain

Results emailed, Base released

R52 tested to n=100k (50-100k)

28 primes found, 100 remain

12827*52^53709-1
69111*52^56234-1
82119*52^58295-1
48759*52^58956-1
33071*52^59206-1
56603*52^59512-1
12423*52^59835-1
16308*52^60156-1
39717*52^60574-1
16007*52^61277-1
16748*52^61624-1
12719*52^66440-1
54693*52^66576-1
9624*52^68479-1
47063*52^69168-1
27767*52^71877-1
62463*52^73310-1
46673*52^80919-1
47913*52^81807-1
58407*52^81857-1
71763*52^84127-1
12401*52^84322-1
55119*52^90896-1
39168*52^91095-1
70703*52^93799-1
11394*52^94360-1
8693*52^95515-1
3870*52^99193-1

Results emailed, Base released

[QUOTE=rebirther;436293]R52 tested to n=100k (50-100k)

28 primes found, 100 remain

12827*52^53709-1
69111*52^56234-1
82119*52^58295-1
48759*52^58956-1
33071*52^59206-1
56603*52^59512-1
12423*52^59835-1
16308*52^60156-1
39717*52^60574-1
16007*52^61277-1
16748*52^61624-1
12719*52^66440-1
54693*52^66576-1
9624*52^68479-1
47063*52^69168-1
27767*52^71877-1
62463*52^73310-1
46673*52^80919-1
47913*52^81807-1
58407*52^81857-1
71763*52^84127-1
12401*52^84322-1
55119*52^90896-1
39168*52^91095-1
70703*52^93799-1
11394*52^94360-1
8693*52^95515-1
3870*52^99193-1

Results emailed, Base released[/QUOTE]

@Gary:
I have one more prime in my list which I have forgot to add:

72344*52^74348-1

I will resend you the primefile for this base. There are 99 remain.

Reserving R94 to n=1M (586.7k-1M) for BOINC

S49
 

S49 has two remaining k at n=600K. I'll try to extend that out to n=1M.

Since there are only two k remaining, how far should I go with sieving? When removing a factor take 50%? 80%? of the time to complete a primality test at n= ~1M?

[QUOTE=paleseptember;436362]S49 has two remaining k at n=600K. I'll try to extend that out to n=1M.

Since there are only two k remaining, how far should I go with sieving? When removing a factor take 50%? 80%? of the time to complete a primality test at n= ~1M?[/QUOTE]

Go high as you can. Conjuncture is weird thing, maybe your prime is inside that range, maybe not. And every single candidate that sieve remove, dont need to be tested. I sow on this forum that recommended is 80% .
On the other side, if you find prime at beginning of your search then you will have many candidates removed...
Decision is yours :)

[QUOTE=paleseptember;436362]S49 has two remaining k at n=600K. I'll try to extend that out to n=1M.

Since there are only two k remaining, how far should I go with sieving? When removing a factor take 50%? 80%? of the time to complete a primality test at n= ~1M?[/QUOTE]

If you knew you were going to test the entire file, you'd optimally sieve until factor-found rate matched the testing time for a candidate 70% of the way from n-min to n-max (~880k in your case). That's roughly 75% of testing time for a candidate at 1M, using (880/1000)^2 to estimate relative testing times.

However, you are not planning to test the entire file- if you find a prime, half the remaining tests will not be run. You could use the heuristic for chance of finding a prime, and solve for optimal sieve time; or you could take a wild-ass-guess and sieve to a point somewhat below 75% of 1M testing time and call it good. My WAG is 10% chance of prime in the entire file, so I'd sieve to about 70% of the 1M testing time; remember that optimal sieving *barely* matters in overall project length; you could get away with 50% or 100% and it won't make very much difference.