Prime numbers p for which the sum of primes less than or equal to p is prime: Difference between revisions

m
→‎{{header|Sidef}}: use a callback function to be memory efficient for larger n
(Added Sidef)
m (→‎{{header|Sidef}}: use a callback function to be memory efficient for larger n)
Line 518:
 
=={{header|Sidef}}==
<lang ruby>func primes_with_prime_sum(n, callback) {
var s = 0
var list = []
n.each_prime {|p|
s += p
list << [callback(p, s]) if s.is_prime
}
list
}
 
for p,s in (primes_with_prime_sum(1000)), {|p,s|
say "prime: #{'%3s' % p} prime sum: #{'%5s' % s}"
})</lang>
{{out}}
<pre>
2,747

edits