/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 vote214 views2 answers
Aes in python
Python
3 votes183 views1 answer
Comparing two dataframe columns
Python
2 votes194 views2 answers
Standard module
Python
0 vote183 views1 answer
Truc python
Python
1 vote264 views1 answer
Python reload lib jupyter notebook %reload
Python
0 vote259 views2 answers
Django domain name
Python Django
1 vote190 views1 answer
Using regex validators in django models
Python
0 vote216 views1 answer
Ouvrir une autre fenetre tkinter
Python
1 vote185 views1 answer
How to minimize command console python
Python
6 votes168 views1 answer
Complex num in python
Python