def getSmallestPrime():
for num in range( 11, 1000, 2 ):
if num % 5 == 0: continue
numDigits = getDigitsIn(num)
for pattern in getPattern5() if num < 100 else getPattern6():
numbers = generateNumbers( pattern, numDigits )
size = len( numbers )
for number in numbers:
if not is_probable_prime( number ):
size -= 1
if size < 8: break
if size == 8:
return numbers[0]
def getFactorialOfDigits( num ):
return sum ( getFactorial( digit ) for digit in getDigitsIn( num ) )
