#George Spahn
#1/28/2024
#OK TO POST

MyIfactor := proc(n)
if isprime(n) then return([n]): fi:
local p := 2:
while (n mod p) > 0 do 
p := nextprime(p):
od:
[p,op(MyIfactor(n/p))]:
end:

# It took this procedure 4 seconds to factor a 25 digit number
# Maples version could handle 70 digit numbers in about the same amount of time