Sum of primes in odd positions is prime: Difference between revisions

(Realize in F#)
Line 557:
</pre>
 
=={{header|Ruby}}==
<lang ruby>require 'prime'
sum = 0
Prime.each(1000).with_index(1).each_slice(2) do |(odd_i, i),(_)|
puts "%6d%6d%6d" % [i, odd_i, sum] if (sum += odd_i).prime?
end
</lang>
{{out}}
<pre> 1 2 2
3 5 7
11 31 89
27 103 659
35 149 1181
67 331 5021
91 467 9923
95 499 10909
99 523 11941
119 653 17959
143 823 26879
 
</pre>
=={{header|Tiny BASIC}}==
<lang tinybasic> LET I = 0
1,149

edits