Prime numbers p for which the sum of primes less than or equal to p is prime: Difference between revisions
Content added Content deleted
m (→{{header|Sidef}}: use a callback function to be memory efficient for larger n) |
|||
| Line 315: | Line 315: | ||
<pre>Found 21 primes: |
<pre>Found 21 primes: |
||
2 3 7 13 37 43 281 311 503 541 557 593 619 673 683 733 743 839 881 929 953</pre> |
2 3 7 13 37 43 281 311 503 541 557 593 619 673 683 733 743 839 881 929 953</pre> |
||
=={{header|Perl}}== |
|||
<lang perl>#!/usr/bin/perl |
|||
use strict; # https://rosettacode.org/wiki/Prime_numbers_p_which_sum_of_prime_numbers_less_or_equal_to_p_is_prime |
|||
use warnings; |
|||
use ntheory qw( is_prime primes vecsum ); |
|||
print "@{[ grep is_prime( vecsum( @{ primes($_) } ) ), @{ primes(1000) } ]}\n";</lang> |
|||
{{out}} |
|||
<pre> |
|||
2 3 7 13 37 43 281 311 503 541 557 593 619 673 683 733 743 839 881 929 953 |
|||
</pre> |
|||
=={{header|Phix}}== |
=={{header|Phix}}== |
||