math problem using recursion?

[mnh001]

Ok, first, it is a decimal point. I was only using it to delineate between the factors for
visual clarity.

Next, I didn't know if this was a good problem for recursion. I was kinda hoping it was just
so I can get some experience with recursion. But if it doesn't need it that's ok too.

The list of primes is there because when factoring the only numbers needed to check for
divisibility are the primes up to the square root of the original number. And since Python
doesn't seem to have any prime routines I had to add the list. Normally when working with
primes I use UBasic but since I'm trying to learn Python...

True, I suppose I didn't really need the dictionary. I could just compute on the fly but this
way I could 'see' things better.

Yes, I believe I mentioned earlier that the seed number is a semi-prime. And a semi-prime
is indeed a number with only 2 factors (excluding 1 and the number itself).

I tried your code (adding a couple of lines for initial input) but got an error.

Error:
Traceback (most recent call last):
  File "c:\Python38-32\Scripts\P1015b.py", line 16, in <module>
    a = divisors(x)
  File "c:\Python38-32\Scripts\P1015b.py", line 10, in divisors
    new_numbers(div)
NameError: name 'new_numbers' is not defined

I take it there's more to it than what you showed?