Anti-primes: Difference between revisions
Content added Content deleted
m (→{{header|REXX}}: changed some variable names.) |
m (→{{header|REXX}}: added wording to the REXX section preamble.) |
||
| Line 313: | Line 313: | ||
=={{header|REXX}}== |
=={{header|REXX}}== |
||
This REXX version is using a modified version of a highly optimized ''proper divisors'' function. |
This REXX version is using a modified version of a highly optimized ''proper divisors'' function. |
||
Programming note: although the solution to this Rosetta Code task is trivial, a fair amount of optimization was incorporated into the REXX program to find larger anti─primes (highly─composite numbers). |
|||
<lang rexx>/*REXX program finds N number of anti─primes or highly─composite numbers. */ |
<lang rexx>/*REXX program finds N number of anti─primes or highly─composite numbers. */ |
||
parse arg N . /*obtain optional argument from the CL.*/ |
parse arg N . /*obtain optional argument from the CL.*/ |
||