Anonymous user
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 02:10, 19 October 2016
, 7 years ago→{{header|zkl}}: fix overflow error
(→{{header|Tcl}}: added zkl) |
(→{{header|zkl}}: fix overflow error) |
||
Line 1,238:
b,biggest := BN(1),0;
while(primes){
b
ps:=List();
foreach p,n in (primes,[1..base-1]){
if((z:=(p + b*n)).probablyPrime()){
ps.append(z);
if(
}
}
| |||