Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re^3: Algorithm for cancelling common factors between two lists of multiplicands

by hv (Prior)
on Jun 10, 2022 at 17:19 UTC ( [id://11144664]=note: print w/replies, xml ) Need Help??


in reply to Re^2: Algorithm for cancelling common factors between two lists of multiplicands
in thread Algorithm for cancelling common factors between two lists of multiplicands

I don't suppose you know of a good factoring algorithm?

From the future: these days, Math::Prime::Util (along with Math::Prime::Util::GMP for larger inputs) is excellent.

  • Comment on Re^3: Algorithm for cancelling common factors between two lists of multiplicands

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://11144664]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (4)
As of 2024-04-25 07:12 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found