but Math::Pari has very fast factorization algorithms.
Indeed it does--blindly fast. And that completely changes the perspective on using the factors in some sort of solution. I'm still finding my way around the huge set of functions in Math::Pari. If POD allowed tables, the looong list of functions could be made more compact and easier to navigate. Even so, I doubt I would have picked out sigma as being useful in this context from the description:
sigma(x,{k = 1}) sum of the k^{th} powers of the positive divisors of |x|. x must be of type integer. The library syntax is sumdiv(x) ( = sigma(x)) or gsumdivk(x,k) ( = sigma(x,k)), where k is a C long integer.
Mmm'kay! :)
Do you have the time/inclination to post code for your solution?
In reply to Re^9: OT: Finding Factor Closest To Square Root
by BrowserUk
in thread OT: Finding Factor Closest To Square Root
by QM
For: | Use: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |