Numbers whose count of divisors is prime: Difference between revisions
Numbers whose count of divisors is prime (view source)
Revision as of 23:04, 28 July 2021
, 2 years agoAdded Perl
(Added Sidef) |
SqrtNegInf (talk | contribs) (Added Perl) |
||
Line 680:
SpeedTest 0.230 secs for 1..4000000000 found 6417</pre>
=={{header|Perl}}==
{{libheader|ntheory}}
<lang perl>use strict;
use warnings;
use ntheory <is_prime divisors>;
push @matches, $_**2 for grep { is_prime divisors $_**2 } 1..int sqrt 1e5;
print @matches . " matching:\n" . (sprintf "@{['%6d' x @matches]}", @matches) =~ s/(.{72})/$1\n/gr;</lang>
{{out}}
<pre>79 matching:
4 9 16 25 49 64 81 121 169 289 361 529
625 729 841 961 1024 1369 1681 1849 2209 2401 2809 3481
3721 4096 4489 5041 5329 6241 6889 7921 9409 10201 10609 11449
11881 12769 14641 15625 16129 17161 18769 19321 22201 22801 24649 26569
27889 28561 29929 32041 32761 36481 37249 38809 39601 44521 49729 51529
52441 54289 57121 58081 59049 63001 65536 66049 69169 72361 73441 76729
78961 80089 83521 85849 94249 96721 97969</pre>
=={{header|Phix}}==
<!--<lang Phix>(phixonline)-->
| |||