Hi shanecruise,

Congrats on yet another nice prime!

1157*2^1308162-1 (393800 digits)

1029*2^1292517-1 (389090 digits)

6555*2^1080139-1 8th drive
325159 digits

oh there's more
5355*2^1080645-1 (325311 digits)

255*2^1422283-1 (428153 digits)

5445*2^1080331-1 (325216 digits)

@kosmaj : sir what are the odds of getting 3 in a single file and counting ;)

[QUOTE=shanecruise;308385]5445*2^1080331-1 (325216 digits)

@kosmaj : sir what are the odds of getting 3 in a single file and counting ;)[/QUOTE]

If we give you the odds of an individual test coming out prime, do you know how to calculate the odds you seek? I once knew those odds off the top of my head, but would have to do some thread-digging to refresh my knowledge.

-Curtis

Sir are you saying
using bernauli trials

suppose Pr[number(n) tested is prime]=x
then in a file of 1400 numbers having exactly three primes is P(3)=C(1400,3)*x^3*(1-x)^(1400-3)

or if we want Pr[3 or more] 1-P(0)-P(1)-P(2)

Given the high sieve depth we should expect one prime in about 10000 tests.
The average test file contains about 1500 tests, which means that on average we expect 0.15 primes per file, or a 1:6.67 chance of finding one prime in a test file. Thus, for 3 primes the chance would be about 1:(6.67)^3 or roughly 1:300.

if 6.67 is the probability of one prime in a file then 1:6.67^3 is probability of finding 1 prime in each of 3 consecutive files.