Anonymous user
Anti-primes: Difference between revisions
m
→{{header|REXX}}: changed title comment.
(→{{header|Kotlin}}: added Lua section) |
m (→{{header|REXX}}: changed title comment.) |
||
Line 757:
The #DIVS function could be further optimized by only processing ''even'' numbers, with unity being treated as a special case.
<lang rexx>/*REXX program finds and displays N number of anti─primes or highly─composite numbers.
parse arg N . /*obtain optional argument from the CL.*/
if N=='' | N=="," then N=20 /*Not specified? Then use the default.*/
| |||