Semiprime: Difference between revisions
Perl 6
Walterpachl (talk | contribs) (added REXX) |
(Perl 6) |
||
Line 15:
[f1, f2] -> f1 * f2 == n
otherwise -> False</lang>
=={{header|Perl 6}}==
Here is a naive implementation. It's grossly inefficient with large numbers.
<lang perl6>sub is-semiprime (Int $n --> Bool) {
return False if $n.is-prime;
my $divisor = first $n %% *, grep &is-prime, 2 .. *;
return ($n div $divisor).is-prime;
}
say is-semiprime( 1679 );</lang>
{{out}}
<pre>True</pre>
=={{header|Racket}}==
|