Numbers whose count of divisors is prime: Difference between revisions
Numbers whose count of divisors is prime (view source)
Revision as of 10:24, 11 July 2021
, 2 years ago→{{header|ALGOL 68}}: No need for a prime sieve - primes have a divisor count of 2.
(Added Algol 68) |
(→{{header|ALGOL 68}}: No need for a prime sieve - primes have a divisor count of 2.) |
||
Line 18:
FOR i FROM 2 TO UPB ndc DO
FOR j FROM i BY i TO UPB ndc DO ndc[ j ] +:= 1 OD
OD;
# show the numbers with prime divisor counts #
Line 36 ⟶ 24:
FOR i TO UPB ndc DO
INT divisor count = ndc[ i ];
IF ODD divisor count AND
print( ( whole( i, -8 ) ) );
IF ( p count +:= 1 ) MOD 10 = 0 THEN print( ( newline ) ) FI
|