Proper divisors: Difference between revisions
m
→Faster Proper Divisor Counting: Added note on running under Algol 68G
m (→{{header|REXX}}: added comments and whitespace.) |
m (→Faster Proper Divisor Counting: Added note on running under Algol 68G) |
||
Line 412:
===Faster Proper Divisor Counting===
Alternative version that uses a sieve-like approach for faster proper divisor counting.
<br><br>Note, in order to run this with Algol 68G under Windows (and possibly Linus) the heap size must be increased, see [[ALGOL_68_Genie#Using_a_Large_Heap]].
<lang algol68>BEGIN # count proper divisors using a sieve-like approach #
# find the first/only number in 1 : 20 000 and 1 : 64 000 000 with #
| |||