/Python/Factors of a number with memoization

Factors of a number with memoization

import math

def memoize(f):
    memo = {}
    def helper(x):
        if x not in memo:
            memo[x] = f(x)
        return memo[x]
    return helper

@memoize
def isprime (n):
    if n == 1:
        return False
    elif n == 2:
        return True
    else:
        for x in range (2, int(math.sqrt(n))+1):
            if n % x == 0:
                return False
                break
        else:
            return True


def factors (a):
    if a == 1:
        return []
    elif isprime(a):
        return [a]
    else:
        for x in range (2, int(math.sqrt(a))+1):
            if a % x == 0:
                return [x] + factors(a/x)

testnumber = int(input("Enter a number."))
print factors(testnumber)

Source: stackoverflow.com

Similar codes

0 vote250 views2 answers
Django domain name
Python Django
0 vote197 views1 answer
YouCompleteMe unavailable: requires Vim compiled with Python (3.6.0+) support.
Python
3 votes192 views2 answers
Python 3.9 ModuleNotFoundError: No module named 'distutils.sysconfig'
Python
0 vote186 views1 answer
Django form set min and max value
Python
0 vote200 views1 answer
Connectionrefusederror at /accounts/signup/ django allauth
Python
0 vote216 views1 answer
Python create a grid of points
Python
3 votes187 views1 answer
GdScript string format
Python
4 votes203 views4 answers
Download pdf python
Python
0 vote190 views1 answer
Python get number of arguments of a function
Python
1 vote199 views1 answer
How to count down in python using turtle graphics
Python