Odd squarefree semiprimes: Difference between revisions
→{{header|ALGOL 68}}: Calculate a more sensible number of primes
(→{{header|ALGOL 68}}: Calculate a more sensible number of primes) |
|||
Line 28:
# show odd square free semi-primes up to 1000 #
INT max number = 1000;
[]INT prime = prime list( max prime );
[ 1 : max number ]BOOL numbers; FOR i TO max number DO numbers[ i ] := FALSE OD;
FOR i FROM 2 TO
FOR j FROM i + 1 TO
WHILE INT pq = prime[ i ] * prime[ j ];
pq < max number
| |||