Find largest left truncatable prime in a given base
func lltp(n) {
var b = 1
var best = nil
var v = (n-1 -> primes)
while (v) {
best = v.max
b *= n
v.map! { |vi|
{|i| i*b + vi }.map(1..^n).grep{.is_prime}...
}
}
return best
}
for i in (3..17) {
printf("%2d %s\n", i, lltp(i))
}Output:
Alternative solution:
Output:
Last updated
Was this helpful?