[Tutor] recursive factoring

[Kirby Urner]

>
>Any suggestions?
>
>-Tim

This change to your factor function seems to work:

    def factor(n):
         if isPrime(n):
            return [n]
         for i in range(2, math.sqrt(n)+1):
            if isPrime(i) and n%i==0:
                return [i] + factor(n/i)

Kirby