/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 vote324 views1 answer
Python program that gives the user a positive integer N, prints the number in the N position of the Fibonacci sequence
Python
28 votes325 views2 answers
Python print without new lines
Python
1 vote343 views1 answer
Ffmpeg python video from images
Python
0 vote352 views2 answers
Remove df rows if two column values are not matching
Python
24 votes363 views2 answers
How to check the type of a variable in python
Python
0 vote435 views1 answer
Nth catalan number
Python
2 votes340 views3 answers
Pandas print dataframe without index
Python
0 vote337 views1 answer
Reset all weights keras
Python
0 vote347 views1 answer
Comment arrêter l'exécution d'un programme python
Python
0 vote329 views1 answer
Text generate gpt 2 huggingface
Python