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


Welcome to the Monastery
	PerlMonks

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

by QM (Parson)

on Aug 10, 2005 at 18:39 UTC ( #482709=note: print w/replies, xml )

Need Help??

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

Can you post your Math::BigInt code and test case? I would like to play around with some other ideas.

Update: Ooops, I see it now, thanks.

-QM
--
Quantum Mechanics: The dreams stuff is made of

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

Replies are listed 'Best First'.

Re^6: Algorithm for cancelling common factors between two lists of multiplicands
by BrowserUk (Patriarch) on Aug 10, 2005 at 18:46 UTC

I already did. It's the second example in 482072.

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

Lingua non convalesco, consenesco et abolesco. -- Rule 1 has a caveat! -- Who broke the cabal?

"Science is about questioning the status quo. Questioning authority".

The "good enough" maybe good enough for the now, and perfection maybe unobtainable, but that should not preclude us from striving for perfection, when time, circumstance or desire allow.

[reply]

In Section Seekers of Perl Wisdom

Domain Nodelet^?

www.com | www.net | www.org

Node Status^?

node history
Node Type: note [id://482709]
help

Chatterbox^?

How do I use this? | Other CB clients

Other Users^?

Others imbibing at the Monastery: (4)

As of 2023-03-20 11:57 GMT

Sections^?

Information^?

Find Nodes^?

Leftovers^?

Voting Booth^?

Notices^?