arithmeticPersistence.py

def mulPer(n):
    """Computes the Multiplicative Persistence of an int or float in base-10 positional notation
    Dependencies: pipe (from meta)
    In: Integer
    Out: Integer"""
    # Exclusions
    if n == 0:
        return 0
    elif len(str(n)) == 1:
        return 0
    elif (len(str(n)) == 2) and (str(1) in str(n)):
        return 1
    elif (str(0) in str(n)):
        return 1
    else:
        cache = []
        while len(str(n)) > 1:
            digitList = [int(i) for i in "".join(str(n).split('.'))]
            n = pipe(digitList)
            cache.append(n)
        return len(cache)


def addPer(n):
    """Computes the Additive Persistence of an int or float in base-10 positional notation
    Dependencies: sigma (from meta)
    In: Integer
    Out: Integer"""
    if len(str(n)) == 1:
        return 0
    elif len(str(n)) < 1:
        return ValueError("Your number of choice has less than one digit")
    else:
        cache = []
        while len(str(n)) > 1:
            digitList = [int(i) for i in "".join(str(n).split('.'))]
            n = sigma(digitList)
            cache.append(n)
        return len(cache)