R270
 

R270 is complete to n=50k
245 primes found for 2500<n<50000
103 k values remain

Results emailed, base released

S304 tested to n=800000 and released. No primes found. Results attached.

463*376^59011+1

is prime! That makes this a 3k conjecture. I've still got a ways to go with my reservation but it is nice to see my luck improve.

64*470^63338+1
16*470^88936+1

are prime. That makes S470 a 2k'er. Still working.

Mathew has completed the following bases and ranges:

R430 for n=25K-50K; 17 primes found; 33 k's remain; base released.
S430 for n=50K-100K; 8 primes found; 5 k's remain (!!); continuing to n=150K.

These are both a high percentage of primes found for a doubling of the n-range, especially S430, which has only 5 k's remaining at n=100K for a conjecture of k=22413! Base 430 is a very high-weight base.

S263
 

S263 completed to n=250k. Continuing.

[QUOTE=c10ck3r;368067]S263 completed to n=250k. Continuing.[/QUOTE]

Is there a reason that you started testing from n=202999? The chances are very remote that all terms were sieved out for n=200K-202998. Can you check your sieve file? Thanks.

Edit: In doing a quick sieve myself, I noticed that you are extremely under-sieved to only P=10G. Depending on the n-range that you are sieving, you should probably sieve to at least 500 times that much or P=~5T or greater. Your tests are taking ~6000 seconds but even a small n-range sieve for n=200K-300K will remove several factors per minute using sr1sieve at P=10G. You are wasting a lot of CPU time.

[QUOTE=gd_barnes;368082]Is there a reason that you started testing from n=202999? The chances are very remote that all terms were sieved out for n=200K-202998. Can you check your sieve file? Thanks.[/QUOTE]

Sorry, reorganized my LLR folder and missed the initial results file.

Edit: Better?
Edit2: Tests take 2700 seconds when running during off-hours, delays are due to other programs being actively used.
Edit the third: Began sr1 to P=5e12 for 200K<n<1M.

OK thanks. It looks like I edited it after you responded. You might check out my edit.

Edit again: I see that the results files don't match up for the overlapping n-ranges. Please attach one big results file for n=200K-250K.

[QUOTE=c10ck3r;368083]Sorry, reorganized my LLR folder and missed the initial results file.

Edit: Better?
Edit2: Tests take 2700 seconds when running during off-hours, delays are due to other programs being actively used.
Edit the third: Began sr1 to P=5e12 for 200K<n<1M.[/QUOTE]

Yeah sure, much better. The P=5e12 estimate was just a wild guess on my part. If you're sieving n=200K-1M, the optimum is definitely higher than that (even for breaking off n=200K to 400K or 500K) but it depends on what range you plan on testing. Do you have an idea of how far you plan to test it?

[QUOTE=gd_barnes;368091]Yeah sure, much better. The P=5e12 estimate was just a wild guess on my part. If you're sieving n=200K-1M, the optimum is definitely higher than that (even for breaking off n=200K to 400K or 500K) but it depends on what range you plan on testing. Do you have an idea of how far you plan to test it?[/QUOTE]

That depends. Do you have an idea of when it will yield a prime? :P

[QUOTE=c10ck3r;368096]That depends. Do you have an idea of when it will yield a prime? :P[/QUOTE]
I would expect 1 prime for 8*263^n+1 on average between n=250,000 and 455,000,000,000,000.
S263 is the 6th lowest weight base, and so while fast to test for a range its chance of prime is pretty low. Plenty of other fish in the sea.