Find largest left truncatable prime in a given base: Difference between revisions
Content added Content deleted
Thundergnat (talk | contribs) (→{{header|Perl 6}}: Update for modern Rakudo.) |
Thundergnat (talk | contribs) m (→{{header|Perl 6}}: fix some white space issues) |
||
Line 953: | Line 953: | ||
my @new; |
my @new; |
||
my $place = $base ** $digits; |
my $place = $base ** $digits; |
||
⚫ | |||
⚫ | |||
my $left = $digit * $place; |
my $left = $digit * $place; |
||
for @stems -> $stem { |
for @stems -> $stem { |
||
my $new = $left + $stem; |
|||
@new.push($new) if $new.is-prime; |
|||
} |
} |
||
} |
} |
||
Line 964: | Line 963: | ||
@stems = @new; |
@stems = @new; |
||
} |
} |
||
say "\nLargest ltp in base $base = { @stems.tail } or :$base\<{@stems.tail.base($base)}>\n"; |
|||
}</lang> |
}</lang> |
||
{{out}} |
{{out}} |