Anti-primes: Difference between revisions

m
→‎{{header|REXX}}: changed a comment.
(→‎{{header|REXX}}: added the REXX computer programming language.)
m (→‎{{header|REXX}}: changed a comment.)
Line 321:
do k=1 until #==N; d= #divs(k) /*obtain the number of divisors for K.*/
if d<=maxD then iterate /*Is D ≤ previous div count? Skip it. */
#= # + 1; $= $ k /*found an anti1primeanti─prime #, add it to list*/
maxD= d /*use this as the new high─water mark. */
end /*k*/