Anonymous user
Numbers whose count of divisors is prime: Difference between revisions
Numbers whose count of divisors is prime (view source)
Revision as of 23:01, 11 July 2021
, 2 years ago→{{header|REXX}}: changed search for positive integers to square integers.
Thundergnat (talk | contribs) m (→{{header|Raku}}: More generic display code) |
m (→{{header|REXX}}: changed search for positive integers to square integers.) |
||
Line 685:
=={{header|REXX}}==
<lang rexx>/*REXX pgm finds positive integers N whose # of divisors is prime (& ¬=2), where N<1000.*/
parse arg hi cols . /*obtain optional arguments from the CL*/
Line 696 ⟶ 695:
say ' index │'center(title, 1 + cols*(w+1) )
say '───────┼'center("" , 1 + cols*(w+1), '─')
finds= 0; idx= 1;
do j=
if \!.n then iterate /*Number divisors prime? No, then skip*/
finds= finds + 1 /*bump the number of found numbers. */
$= $ right( commas(j), w) /*add a positive integer ──► $ list. */
| |||