Summarize primes: Difference between revisions
→{{header|ALGOL 68}}: Small change so it can also do the "Prime numbers p which sum of prime numbers less or equal to p is prime" task
m (→{{header|REXX}}: simplified program, added/changed whitespace and comments.) |
(→{{header|ALGOL 68}}: Small change so it can also do the "Prime numbers p which sum of prime numbers less or equal to p is prime" task) |
||
Line 20:
INT prime count := 0;
INT prime sum count := 0;
print( ( "prime prime", newline ) );
print( ( "count prime sum", newline ) );
FOR i TO max prime DO
IF prime[ i ] THEN
Line 36:
prime sum count +:= 1;
print( ( whole( prime count, -5 )
, " "
, whole( i, -6 )
, " "
, whole( prime sum, -6 )
Line 52 ⟶ 54:
)
)
END
</lang>
{{out}}
<pre>
prime prime
count prime sum
1 2 2
2 3 5
4 7 17
6 13 41
12 37 197
14 43 281
60 281 7699
64 311 8893
96 503 22039
100 541 24133
102 557 25237
108 593 28697
114 619 32353
122 673 37561
124 683 38921
130 733 43201
132 743 44683
146 839 55837
152 881 61027
158 929 66463
162 953 70241
Found 21 prime sums of primes below 1000
| |||