Find biggest fragile prime (primeModule = http://codepad.org/KtXsydxK)

fragilePrime.py

from primeModule import is_prime

biggest = 1
n = lambda a,b,c: '9'*a + b + '9'*c

for j in range(1000):
    for digit in '124578':
        for i in range(2000):
            number = int(n(i,digit,j))
            if is_prime(number):
                if (number > biggest):
                    if all(not is_prime(int(n(i,digit,k))) for k in range(j)):
                        biggest = number
                        print(i+j+1, biggest)
                break