Truncatable primes: Difference between revisions
Content added Content deleted
(→{{header|Perl 6}}: prime tester was technically incorrect on 2, though we never test even numbers here) |
(→{{header|Perl 6}}: avoid X which is slow in rakudo, and this matches the rtp solution better anyway) |
||
Line 1,100: | Line 1,100: | ||
sub ltp { |
sub ltp { |
||
for |
for 9...1 -> $a { |
||
for 9...1 -> $b { |
|||
⚫ | |||
for 9...1 -> $c { |
|||
for 9...1 -> $d { |
|||
prime @x[3] and prime @x[4] and prime @x[5]; |
|||
for 9...1 -> $e { |
|||
for 9,7,3 -> $f { |
|||
⚫ | |||
return @x[*-1] if not grep {not prime $^n}, @x; |
|||
} |
|||
} |
|||
} |
|||
} |
|||
} |
|||
} |
} |
||
} |
} |