Prime numbers p for which the sum of primes less than or equal to p is prime: Difference between revisions
Content added Content deleted
(Added Sidef) |
m (→{{header|Sidef}}: use a callback function to be memory efficient for larger n) |
||
Line 518: | Line 518: | ||
=={{header|Sidef}}== |
=={{header|Sidef}}== |
||
<lang ruby>func primes_with_prime_sum(n) { |
<lang ruby>func primes_with_prime_sum(n, callback) { |
||
var s = 0 |
var s = 0 |
||
var list = [] |
|||
n.each_prime {|p| |
n.each_prime {|p| |
||
s += p |
s += p |
||
callback(p, s) if s.is_prime |
|||
} |
} |
||
list |
|||
} |
} |
||
primes_with_prime_sum(1000, {|p,s| |
|||
say "prime: #{'%3s' % p} prime sum: #{'%5s' % s}" |
say "prime: #{'%3s' % p} prime sum: #{'%5s' % s}" |
||
}</lang> |
})</lang> |
||
{{out}} |
{{out}} |
||
<pre> |
<pre> |