/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 vote235 views1 answer
Sklearn model persistence
Python
0 vote240 views4 answers
Adaptive_average_pool-2d
Python
0 vote235 views1 answer
How to rinstalll re
Python
0 vote205 views1 answer
The process of delivery of any desisered data
Python
0 vote235 views1 answer
Pathlib check is file
Python
0 vote226 views1 answer
Comment voir les requêtes SQL brutes exécutées par Django?
Python
0 vote237 views1 answer
How can space be bent
Python
2 votes219 views2 answers
Instagram private account hacking code python
Python
0 vote255 views1 answer
Isidentifier method in python
Python
0 vote240 views1 answer
How to change order of attributes of an element using beautiful soup
Python