One-two primes: Difference between revisions
m
→{{header|Perl}}: improved 'condense' (no args required)
Thundergnat (talk | contribs) m (→Generalized: A little less terse. Exact same functionality but better names and whitespace) |
SqrtNegInf (talk | contribs) m (→{{header|Perl}}: improved 'condense' (no args required)) |
||
Line 371:
use ntheory 'is_prime';
sub condense
sub combine ($d, $a, $b, $s='') { # NB: $a < $b
if ($d == 1 && is_prime $s.$a) { return $s.$a
} elsif ($d == 1 && is_prime $s.$b) { return $s.$b
Line 382:
my($a,$b) = (1,2);
say "Smallest n digit prime using only $a and $b (or '0' if none exists):";
printf "%4d: %s\n", $_, combine($_,$a,$b)
printf "%4d: %s\n", $_, condense
($a,$b) = (7,9);
say "\nSmallest n digit prime using only $a and $b (or '0' if none exists):";
printf "%4d: %s\n", $_, condense
# 1st term missing
| |||