Numbers whose count of divisors is prime: Difference between revisions
Numbers whose count of divisors is prime (view source)
Revision as of 03:12, 11 July 2021
, 2 years agono edit summary
No edit summary |
|||
Line 1:
{{Draft task}}
;Task:Find numbers which count of divisors is prime but not equal to 2, where '''n <
<br><br>
Line 13:
see "Numbers which count of divisors is prime are:" + nl
for n = 1 to
num = 0
for m = 1 to n
Line 20:
ok
next
if isprime(num) and num != 2
see "" + n + " "
row++
Line 29:
next
see nl + "Found " + row + " numbers" + nl
see "done..." + nl
</lang>
Line 35 ⟶ 36:
working...
Numbers which count of divisors is prime are:
961
Found 16 numbers
done...
</pre>
| |||