Numbers whose count of divisors is prime: Difference between revisions
Content added Content deleted
No edit summary |
m (→{{header|REXX}}: added a REXX stub.) |
||
Line 4: | Line 4: | ||
<br><br> |
<br><br> |
||
=={{header|REXX}}== |
|||
<lang rexx></lang> |
|||
=={{header|Ring}}== |
=={{header|Ring}}== |
Revision as of 03:33, 11 July 2021
Numbers whose count of divisors is prime is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page.
- Task
- Find numbers which count of divisors is prime but not equal to 2, where n < 1,000
REXX
<lang rexx></lang>
Ring
<lang ring> load "stdlib.ring" row = 0
see "working..." + nl see "Numbers which count of divisors is prime are:" + nl
for n = 1 to 1000
num = 0 for m = 1 to n if n%m = 0 num++ ok next if isprime(num) and num != 2 see "" + n + " " row++ if row%5 = 0 see nl ok ok
next
see nl + "Found " + row + " numbers" + nl see "done..." + nl </lang>
- Output:
working... Numbers which count of divisors is prime are: 4 9 16 25 49 64 81 121 169 289 361 529 625 729 841 961 Found 16 numbers done...