CalmoSoft primes: Difference between revisions

Content added Content deleted
(Added Perl)
(J draft)
Line 869: Line 869:
Took 210 ms
Took 210 ms
</pre>
</pre>

=={{header|J}}==

It would be useful to find the length of the longest sequence of these primes where the sum is prime:

<syntaxhighlight lang=J> >./,(+/\\. 99#1)*1 p: +/\\. p:i.99
96</syntaxhighlight>

With this, we can check all sums of subsequences of 96 primes (from the first 99 primes) for primality:

<syntaxhighlight lang=J> 1 p: 96+/\p:i.99
1 0 0 0</syntaxhighlight>

In other words, the sum of these primes

<syntaxhighlight lang=J> p:i.8 12
2 3 5 7 11 13 17 19 23 29 31 37
41 43 47 53 59 61 67 71 73 79 83 89
97 101 103 107 109 113 127 131 137 139 149 151
157 163 167 173 179 181 191 193 197 199 211 223
227 229 233 239 241 251 257 263 269 271 277 281
283 293 307 311 313 317 331 337 347 349 353 359
367 373 379 383 389 397 401 409 419 421 431 433
439 443 449 457 461 463 467 479 487 491 499 503</syntaxhighlight>

is this prime:

<syntaxhighlight lang=J> +/p:i.96
22039</syntaxhighlight>


=={{header|Java}}==
=={{header|Java}}==