multiplicative-persistance.py

def persistance(N, steps=0):
    if len(str(N)) > 1:
        steps += 1
        digits = [int(x) for x in str(N)]
        result = 1
        for i in digits:
            result *= i
        steps = persistance(result, steps)
    return steps


n = int(input('Enter the multiplicative persistance: '))
MP = 0
count = 0
while True:
    count += 1
    MP = persistance(count)
    if MP == n:
        print('Smallest number with persistance of', n, 'is', count)
        break