Numbers whose count of divisors is prime: Difference between revisions

Content added Content deleted
m (C++ - only test square numbers)
m (→‎{{header|Raku}}: Simplify)
Line 666: Line 666:
my $ceiling = ceiling sqrt 1e5;
my $ceiling = ceiling sqrt 1e5;


say display 10, '%6d', (^$ceiling)».² .grep: { ((my $d = .&divisors) % 2) && $d.is-prime };
say display 10, '%6d', (^$ceiling)».² .grep: { .&divisors.is-prime };


sub display {
sub display {