Rosetta Code

Numbers whose count of divisors is prime: Difference between revisions

Page Discussion

Numbers whose count of divisors is prime (view source)

Revision as of 03:48, 11 July 2021

79 bytes added ,  2 years ago
m
changed "numbers" to "positive integers", added whitespace.
m (→‎{{header|REXX}}: added the computer programming language REXX.)
m (changed "numbers" to "positive integers", added whitespace.)
Line 1:
{{Draft task}}
 
;Task:
;Task:Find numberspositive integers &nbsp; '''n''' &nbsp; which count of divisors is prime, &nbsp; but not equal to &nbsp;'''2''', &nbsp; where &nbsp; '''n <&nbsp; &lt; &nbsp; 1,000'''.
 
<br><br>
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/313554"