Anti-primes: Difference between revisions
Content deleted Content added
+Racket |
m →even and odd numbers: added wording to the section header. |
||
Line 1,317:
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 (also known as ''highly─composite numbers'').
The #DIVS function could be further optimized by only processing ''even'' numbers, with unity being treated as a special case.
| |||