/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

10 votes372 views4 answers
Set method in python
Python
1 vote358 views1 answer
Who wrote permission to dance
Python
4 votes368 views2 answers
Hpw tp install discord.py
Python
2 votes367 views3 answers
Solve equation python
Python
0 vote367 views1 answer
Dataframe no names from file
Python
5 votes361 views1 answer
Reindexing Dataframe in Pandas
Python
0 vote418 views1 answer
Pyqt graph
Python
0 vote348 views1 answer
Python argparse option groups
Python
0 vote338 views1 answer
OfficeApi
Python
0 vote360 views1 answer
How to wait until pressing button in tkinter
Python