Find largest left truncatable prime in a given base: Difference between revisions
Find largest left truncatable prime in a given base (view source)
Revision as of 12:44, 16 May 2020
, 4 years ago→{{header|Raku}}: Use a library for primality checking
(→{{header|Phix}}: replaced with gmp version) |
Thundergnat (talk | contribs) m (→{{header|Raku}}: Use a library for primality checking) |
||
Line 1,489:
{{works with|Rakudo|2018.12}}
Pretty fast for bases 3 .. 11. 12 is slow. 18 is glacial.
<lang perl6>
for 3 .. 11 -> $base {
say "Starting base $base...";
my @stems = grep { .is-prime }, ^$base;
Line 1,498 ⟶ 1,500:
for 1 ..^ $base -> $digit {
my $left = $digit * $place;
@new.append: (@stems »+» $left).
}
last unless +@new;
| |||