Anonymous user
Untouchable numbers: Difference between revisions
m
→{{header|REXX}}: added some wording to the REXX section header.
m (→{{header|REXX}}: added some wording to the REXX section header.) |
|||
Line 592:
A fair amount of code was put into the generation of primes, but the computation of the aliquot sum is the area
<br>that consumes the most CPU time.
The REXX code below will accurately calculate ''untouchable numbers'' up to and including 100,000. Beyond that,
<br>a higher overreach (the '''over''' option) would be need to specified.
This version of REXX would need a 64-bit version to calculate the number of untouchable numbers for one million.
| |||