in reply to Re: Algorithm for cancelling common factors between two lists of multiplicands
in thread Algorithm for cancelling common factors between two lists of multiplicands
There are better ways to compute factorial quotients without overflow or loss of precision.
So, now I've got my "schoolboy approach" working, care to point me at the methods clever people would use?
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.
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^3: Algorithm for cancelling common factors between two lists of multiplicands
by QM (Parson) on Aug 09, 2005 at 15:19 UTC |
In Section
Seekers of Perl Wisdom