Rosetta Code

Find largest left truncatable prime in a given base: Difference between revisions

Page Discussion

Find largest left truncatable prime in a given base (view source)

Revision as of 21:53, 20 April 2017

57 bytes removed ,  7 years ago
m
→‎{{header|Sidef}}: code simplifications
m (→‎{{header|Perl 6}}: Remove unused variable. Fossil from refactor.)
m (→‎{{header|Sidef}}: code simplifications)
Line 1,265:
i = j.next_prime
i <= n || break
take(j = i)
j = i
}
}
Line 1,275 ⟶ 1,274:
var best = nil
var v = primes(n-1)
 
 
while (v) {
best = v.max
b *= n
v.map! ={ gather {|vi|
v.each { |vii| i*b + vi }.map(1..^n).grep{.is_prime}...
take((n-1).of { |i| i*b + vi }.grep{.is_prime}...)
}
}
}
 
 
return best
}
 
for i in (3..17) {
printf("%2d  %s\n", i, lltp(i))
}</lang>
{{out}}
Trizen
2,747

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/219339"