Program: Decomposition numbers on prefactors

[Finki]

So im putting together a program that decompositions numbers on prefactors.

Example:

252=2^2 3^2 7^1 and 1944=2^3 3^5

Put this into tuples:

(wont use split, just for example)

>>> split(252)
[(2, 2), (3, 2), (7, 1)]
>>> split(1944)
[(2, 3), (3, 5)]

This is the code that determines whether a given number is prime.

def prime(n ):
    for i in range(2, n):
        if n % i == 0:
            return False
    return True

So now I'm stuck here. I figured out what I must to next but can't seem to find the right code to do it. I need to write a function primes(n) that returns all the primes between 2(included) and n. Then I should write a fuction that tells me how many times the number n is divided by i - something like this:

devided(n, i)

devided (1944, 2)
3

Then I'm lost again. :-/

[woooee]

See this post. If you're not in the same class and have a different problem, post back with the differences.

[Finki]

Thank you for answers in the other thread.