Jump to content

Untouchable numbers: Difference between revisions

m
→‎{{header|REXX}}: changed wording in the REXX section header.
m (promote to full task.)
m (→‎{{header|REXX}}: changed wording in the REXX section header.)
Line 513:
=={{header|REXX}}==
Some optimization was done to the code to produce prime numbers,   since a simple test could be made to exclude
<br>the calculation of touchability for primes as the aliquot sum of a prime is always unity.
<br>This saved around &nbsp; '''15%''' &nbsp; of the running time.
 
A fair amount of code was put into the generation of primes, &nbsp; but the computation of the aliquot sum wasis the area
<br>that consumedconsumes the most CPU time.
 
This version doesn't appear to calculate the correct number of untouchable numbers for one million.
Cookies help us deliver our services. By using our services, you agree to our use of cookies.