Big primes by murky-satyr

val n=32416187567L
for(i<-0 to 2505 if BigInt(n+i)isProbablePrime 9)println(n+i)

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

download

return to the top page